java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:57:46,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:57:46,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:57:46,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:57:46,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:57:46,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:57:46,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:57:46,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:57:46,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:57:46,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:57:46,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:57:46,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:57:46,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:57:46,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:57:46,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:57:46,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:57:46,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:57:46,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:57:46,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:57:46,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:57:46,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:57:46,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:57:46,523 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:57:46,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:57:46,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:57:46,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:57:46,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:57:46,526 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:57:46,528 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:57:46,529 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:57:46,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:57:46,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:57:46,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:57:46,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:57:46,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:57:46,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:57:46,535 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:57:46,560 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:57:46,560 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:57:46,561 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:57:46,561 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:57:46,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:57:46,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:57:46,566 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:57:46,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:57:46,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:57:46,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:57:46,566 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:57:46,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:57:46,568 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:57:46,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:57:46,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:57:46,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:57:46,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:57:46,569 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:57:46,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:57:46,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:57:46,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:57:46,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:57:46,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:57:46,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:57:46,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:57:46,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:57:46,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:57:46,572 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:57:46,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:57:46,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:57:46,572 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:57:46,624 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:57:46,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:57:46,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:57:46,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:57:46,644 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:57:46,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i [2018-11-18 23:57:46,697 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18f14ad/53907bb0c5b443c0a81b9777d908b9dc/FLAG968067f3b [2018-11-18 23:57:47,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:57:47,111 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i [2018-11-18 23:57:47,116 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18f14ad/53907bb0c5b443c0a81b9777d908b9dc/FLAG968067f3b [2018-11-18 23:57:47,474 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba18f14ad/53907bb0c5b443c0a81b9777d908b9dc [2018-11-18 23:57:47,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:57:47,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:57:47,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:47,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:57:47,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:57:47,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcf46f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47, skipping insertion in model container [2018-11-18 23:57:47,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:57:47,538 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:57:47,751 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:47,759 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:57:47,779 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:47,796 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:57:47,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47 WrapperNode [2018-11-18 23:57:47,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:47,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:57:47,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:57:47,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:57:47,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (1/1) ... [2018-11-18 23:57:47,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:57:47,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:57:47,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:57:47,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:57:47,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (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-18 23:57:47,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:57:47,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:57:47,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:57:47,970 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:57:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:57:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:57:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 23:57:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:57:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:57:47,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:57:48,376 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:57:48,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:48 BoogieIcfgContainer [2018-11-18 23:57:48,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:57:48,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:57:48,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:57:48,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:57:48,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:57:47" (1/3) ... [2018-11-18 23:57:48,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18313d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:48, skipping insertion in model container [2018-11-18 23:57:48,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:47" (2/3) ... [2018-11-18 23:57:48,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18313d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:48, skipping insertion in model container [2018-11-18 23:57:48,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:48" (3/3) ... [2018-11-18 23:57:48,384 INFO L112 eAbstractionObserver]: Analyzing ICFG count_up_down_true-unreach-call_true-termination.i [2018-11-18 23:57:48,393 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:57:48,400 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:57:48,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:57:48,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:57:48,447 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:57:48,447 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:57:48,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:57:48,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:57:48,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:57:48,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:57:48,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:57:48,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:57:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-18 23:57:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 23:57:48,479 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:48,480 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:48,482 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:48,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-18 23:57:48,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:48,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:48,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:48,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:48,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-18 23:57:48,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-18 23:57:48,616 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-18 23:57:48,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret3 := main(); {21#true} is VALID [2018-11-18 23:57:48,617 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {21#true} is VALID [2018-11-18 23:57:48,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-18 23:57:48,618 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-18 23:57:48,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-18 23:57:48,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-18 23:57:48,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-18 23:57:48,622 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-18 23:57:48,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:48,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:57:48,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 23:57:48,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:48,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:57:48,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:48,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:57:48,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:57:48,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:57:48,705 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-18 23:57:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:48,776 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 23:57:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:57:48,776 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 23:57:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-18 23:57:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-18 23:57:48,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-18 23:57:48,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:48,972 INFO L225 Difference]: With dead ends: 29 [2018-11-18 23:57:48,973 INFO L226 Difference]: Without dead ends: 12 [2018-11-18 23:57:48,978 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-18 23:57:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-18 23:57:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-18 23:57:49,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:49,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-18 23:57:49,102 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-18 23:57:49,102 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-18 23:57:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:49,105 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-18 23:57:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 23:57:49,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:49,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:49,107 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-18 23:57:49,108 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-18 23:57:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:49,113 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-18 23:57:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 23:57:49,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:49,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:49,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:49,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:57:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-18 23:57:49,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-18 23:57:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:49,121 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-18 23:57:49,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:57:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-18 23:57:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 23:57:49,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:49,123 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:49,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:49,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-18 23:57:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:49,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:49,707 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2018-11-18 23:57:50,050 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2018-11-18 23:57:50,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-18 23:57:50,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-18 23:57:50,129 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-18 23:57:50,129 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret3 := main(); {106#true} is VALID [2018-11-18 23:57:50,140 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {108#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= 0 main_~y~0))) (= main_~x~0 main_~n~0))} is VALID [2018-11-18 23:57:50,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= 0 main_~y~0))) (= main_~x~0 main_~n~0))} assume true; {108#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= 0 main_~y~0))) (= main_~x~0 main_~n~0))} is VALID [2018-11-18 23:57:50,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {108#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= 0 main_~y~0))) (= main_~x~0 main_~n~0))} assume !(~x~0 % 4294967296 > 0); {109#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} is VALID [2018-11-18 23:57:50,166 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {110#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:50,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {110#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {111#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:50,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {111#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {107#false} is VALID [2018-11-18 23:57:50,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-18 23:57:50,170 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-18 23:57:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:50,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 23:57:50,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-18 23:57:50,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:50,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:57:50,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:50,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:57:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:57:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:57:50,209 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-18 23:57:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:50,819 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-18 23:57:50,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:57:50,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-18 23:57:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:57:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-18 23:57:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:57:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-18 23:57:50,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2018-11-18 23:57:50,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:50,934 INFO L225 Difference]: With dead ends: 19 [2018-11-18 23:57:50,935 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 23:57:50,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:57:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 23:57:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 23:57:50,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:50,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-18 23:57:50,953 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 23:57:50,953 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 23:57:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:50,955 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 23:57:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:57:50,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:50,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:50,956 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 23:57:50,956 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 23:57:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:50,958 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 23:57:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:57:50,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:50,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:50,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:50,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:57:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 23:57:50,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-18 23:57:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:50,961 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 23:57:50,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:57:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:57:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 23:57:50,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:50,962 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:50,962 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:50,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-18 23:57:50,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:50,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:50,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:50,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:51,367 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-18 23:57:51,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-18 23:57:51,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-18 23:57:51,744 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} #32#return; {197#true} is VALID [2018-11-18 23:57:51,745 INFO L256 TraceCheckUtils]: 3: Hoare triple {197#true} call #t~ret3 := main(); {197#true} is VALID [2018-11-18 23:57:51,745 INFO L273 TraceCheckUtils]: 4: Hoare triple {197#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:51,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume true; {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:51,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {200#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} is VALID [2018-11-18 23:57:51,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {200#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} assume true; {200#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} is VALID [2018-11-18 23:57:51,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {200#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} assume !(~x~0 % 4294967296 > 0); {201#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} is VALID [2018-11-18 23:57:51,754 INFO L256 TraceCheckUtils]: 9: Hoare triple {201#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {202#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:51,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {202#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {203#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:51,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {203#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {198#false} is VALID [2018-11-18 23:57:51,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-18 23:57:51,760 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-18 23:57:51,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:51,760 INFO L223 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-18 23:57:51,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:51,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:52,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-18 23:57:52,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-18 23:57:52,076 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} #32#return; {197#true} is VALID [2018-11-18 23:57:52,077 INFO L256 TraceCheckUtils]: 3: Hoare triple {197#true} call #t~ret3 := main(); {197#true} is VALID [2018-11-18 23:57:52,077 INFO L273 TraceCheckUtils]: 4: Hoare triple {197#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:52,078 INFO L273 TraceCheckUtils]: 5: Hoare triple {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume true; {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:52,079 INFO L273 TraceCheckUtils]: 6: Hoare triple {199#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {225#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) (<= main_~y~0 1))} is VALID [2018-11-18 23:57:52,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) (<= main_~y~0 1))} assume true; {225#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) (<= main_~y~0 1))} is VALID [2018-11-18 23:57:52,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {232#(and (<= 1 main_~y~0) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (<= main_~y~0 1))} is VALID [2018-11-18 23:57:52,088 INFO L256 TraceCheckUtils]: 9: Hoare triple {232#(and (<= 1 main_~y~0) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {202#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:52,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {202#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {203#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:52,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {203#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {198#false} is VALID [2018-11-18 23:57:52,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-18 23:57:52,090 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-18 23:57:52,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:57:52,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-18 23:57:52,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-18 23:57:52,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:52,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:57:52,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:52,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:57:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:57:52,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:57:52,179 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 9 states. [2018-11-18 23:57:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:52,651 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 23:57:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:57:52,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-11-18 23:57:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:57:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-18 23:57:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:57:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-18 23:57:52,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 25 transitions. [2018-11-18 23:57:52,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:52,701 INFO L225 Difference]: With dead ends: 24 [2018-11-18 23:57:52,701 INFO L226 Difference]: Without dead ends: 18 [2018-11-18 23:57:52,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:57:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-18 23:57:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 23:57:52,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:52,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-18 23:57:52,729 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 23:57:52,729 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 23:57:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:52,732 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-18 23:57:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-18 23:57:52,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:52,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:52,733 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 23:57:52,733 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 23:57:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:52,735 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-18 23:57:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-18 23:57:52,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:52,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:52,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:52,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:57:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-18 23:57:52,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2018-11-18 23:57:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:52,739 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-18 23:57:52,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:57:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-18 23:57:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:57:52,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:52,740 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:52,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:52,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 2 times [2018-11-18 23:57:52,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:52,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:52,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:52,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:52,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:53,147 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-18 23:57:53,530 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-18 23:57:53,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-18 23:57:53,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-18 23:57:53,911 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {349#true} {349#true} #32#return; {349#true} is VALID [2018-11-18 23:57:53,912 INFO L256 TraceCheckUtils]: 3: Hoare triple {349#true} call #t~ret3 := main(); {349#true} is VALID [2018-11-18 23:57:53,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {349#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:53,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume true; {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:53,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {352#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= 1 main_~y~0) (<= (+ main_~x~0 main_~y~0) main_~n~0))} is VALID [2018-11-18 23:57:53,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {352#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= 1 main_~y~0) (<= (+ main_~x~0 main_~y~0) main_~n~0))} assume true; {352#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= 1 main_~y~0) (<= (+ main_~x~0 main_~y~0) main_~n~0))} is VALID [2018-11-18 23:57:53,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {352#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= 1 main_~y~0) (<= (+ main_~x~0 main_~y~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {353#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= (+ main_~x~0 main_~y~0) main_~n~0) (<= 2 main_~y~0))} is VALID [2018-11-18 23:57:53,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {353#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= (+ main_~x~0 main_~y~0) main_~n~0) (<= 2 main_~y~0))} assume true; {353#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= (+ main_~x~0 main_~y~0) main_~n~0) (<= 2 main_~y~0))} is VALID [2018-11-18 23:57:53,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {353#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= (+ main_~x~0 main_~y~0) main_~n~0) (<= 2 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {354#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} is VALID [2018-11-18 23:57:53,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {354#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} assume true; {354#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} is VALID [2018-11-18 23:57:53,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {354#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} assume !(~x~0 % 4294967296 > 0); {355#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} is VALID [2018-11-18 23:57:53,952 INFO L256 TraceCheckUtils]: 13: Hoare triple {355#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {356#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:53,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {357#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:53,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {350#false} is VALID [2018-11-18 23:57:53,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-18 23:57:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:53,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:53,959 INFO L223 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-18 23:57:53,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:57:54,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:57:54,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:57:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:54,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:54,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-18 23:57:54,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-18 23:57:54,706 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {349#true} {349#true} #32#return; {349#true} is VALID [2018-11-18 23:57:54,706 INFO L256 TraceCheckUtils]: 3: Hoare triple {349#true} call #t~ret3 := main(); {349#true} is VALID [2018-11-18 23:57:54,715 INFO L273 TraceCheckUtils]: 4: Hoare triple {349#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:54,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume true; {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-18 23:57:54,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {351#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {379#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-18 23:57:54,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {379#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume true; {379#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-18 23:57:54,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {379#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {386#(and (= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-18 23:57:54,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#(and (= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= 2 main_~y~0))} assume true; {386#(and (= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-18 23:57:54,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#(and (= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= 2 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {393#(and (= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2018-11-18 23:57:54,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {393#(and (= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume true; {393#(and (= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2018-11-18 23:57:54,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {393#(and (= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {400#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2018-11-18 23:57:54,763 INFO L256 TraceCheckUtils]: 13: Hoare triple {400#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {356#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:54,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {357#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:54,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {350#false} is VALID [2018-11-18 23:57:54,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-18 23:57:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:57:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-18 23:57:54,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-11-18 23:57:54,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:54,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:57:54,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:54,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:57:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:57:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:57:54,885 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 13 states. [2018-11-18 23:57:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:55,638 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-18 23:57:55,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:57:55,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-11-18 23:57:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:57:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-11-18 23:57:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:57:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 22 transitions. [2018-11-18 23:57:55,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 22 transitions. [2018-11-18 23:57:55,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:55,697 INFO L225 Difference]: With dead ends: 21 [2018-11-18 23:57:55,697 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:57:55,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:57:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:57:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:57:55,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:55,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:55,699 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:55,699 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:55,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:57:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:57:55,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:55,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:55,700 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:55,700 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:55,701 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:57:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:57:55,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:55,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:55,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:55,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:57:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:57:55,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-18 23:57:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:55,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:57:55,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:57:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:57:55,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:55,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:57:55,946 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2018-11-18 23:57:55,960 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 23:57:55,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:57:55,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:57:55,960 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:57:55,960 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:57:55,961 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:57:55,961 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 21) the Hoare annotation is: true [2018-11-18 23:57:55,961 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2018-11-18 23:57:55,961 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-11-18 23:57:55,961 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2018-11-18 23:57:55,962 INFO L421 ceAbstractionStarter]: At program point L15-3(lines 15 19) the Hoare annotation is: (let ((.cse2 (+ main_~x~0 main_~y~0))) (let ((.cse0 (<= main_~n~0 .cse2)) (.cse1 (<= .cse2 main_~n~0))) (or (and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) .cse0 .cse1 (<= 2 main_~y~0)) (and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0)) (and .cse0 (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) .cse1 (<= main_~y~0 1))))) [2018-11-18 23:57:55,962 INFO L421 ceAbstractionStarter]: At program point L15-4(lines 15 19) the Hoare annotation is: (let ((.cse1 (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (.cse0 (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2018-11-18 23:57:55,962 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 23:57:55,962 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:57:55,963 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 23:57:55,963 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 23:57:55,963 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 23:57:55,963 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:57:55,965 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:57:55,970 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:57:55,970 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:57:55,970 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:57:55,970 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:57:55,971 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:57:55,972 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 23:57:55,972 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:57:55,972 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 23:57:55,972 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:57:55,972 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:57:55,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:57:55 BoogieIcfgContainer [2018-11-18 23:57:55,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:57:55,985 INFO L168 Benchmark]: Toolchain (without parser) took 8501.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -366.6 MB). Peak memory consumption was 371.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:55,987 INFO L168 Benchmark]: CDTParser took 0.18 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-18 23:57:55,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.19 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-18 23:57:55,988 INFO L168 Benchmark]: Boogie Preprocessor took 36.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:57:55,989 INFO L168 Benchmark]: RCFGBuilder took 542.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:55,990 INFO L168 Benchmark]: TraceAbstraction took 7606.59 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 408.4 MB). Peak memory consumption was 408.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:55,994 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 312.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 542.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7606.59 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 408.4 MB). Peak memory consumption was 408.4 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: 15]: Loop Invariant Derived loop invariant: ((((n <= 4294967296 * (x / 4294967296) + 4294967295 && n <= x + y) && x + y <= n) && 2 <= y) || ((0 <= y && x == n) && y <= 0)) || ((((n <= x + y && 1 <= y) && 0 < n % 4294967296) && x + y <= n) && y <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 11 SDslu, 150 SDs, 0 SdLazy, 104 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 92 HoareAnnotationTreeSize, 12 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 248 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 10349 SizeOfPredicates, 6 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...