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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum01_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:40,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:40,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:40,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:40,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:40,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:40,607 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:40,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:40,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:40,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:40,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:40,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:40,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:40,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:40,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:40,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:40,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:40,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:40,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:40,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:40,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:40,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:40,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:40,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:40,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:40,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:40,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:40,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:40,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:40,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:40,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:40,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:40,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:40,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:40,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:40,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:40,649 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-23 13:02:40,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:40,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:40,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:40,683 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:40,684 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:40,684 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:40,684 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:40,684 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:40,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:40,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:40,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:40,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:40,686 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:40,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:40,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:40,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:40,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:40,687 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:40,689 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:40,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:40,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:40,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:40,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:40,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:40,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:40,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:40,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:40,691 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:40,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:40,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:40,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:40,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:40,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:40,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:40,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:40,768 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:40,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_false-unreach-call_true-termination.i [2018-11-23 13:02:40,841 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f2efa4f/f2a80097e6b749f5a729e167e24d57b4/FLAGc40bbf458 [2018-11-23 13:02:41,310 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:41,311 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_false-unreach-call_true-termination.i [2018-11-23 13:02:41,317 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f2efa4f/f2a80097e6b749f5a729e167e24d57b4/FLAGc40bbf458 [2018-11-23 13:02:41,682 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f2efa4f/f2a80097e6b749f5a729e167e24d57b4 [2018-11-23 13:02:41,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:41,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:41,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:41,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:41,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:41,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:41,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e02680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41, skipping insertion in model container [2018-11-23 13:02:41,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:41,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:41,746 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:41,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:41,936 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:41,955 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:41,973 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:41,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41 WrapperNode [2018-11-23 13:02:41,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:41,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:41,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:41,976 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:41,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:41,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:42,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:42,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:42,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:42,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (1/1) ... [2018-11-23 13:02:42,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:42,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:42,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:42,043 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:42,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (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-23 13:02:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:42,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:42,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:42,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:42,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:42,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:42,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:42,772 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:42,773 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:42,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:42 BoogieIcfgContainer [2018-11-23 13:02:42,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:42,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:42,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:42,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:42,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:41" (1/3) ... [2018-11-23 13:02:42,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7fb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:42, skipping insertion in model container [2018-11-23 13:02:42,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:41" (2/3) ... [2018-11-23 13:02:42,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7fb59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:42, skipping insertion in model container [2018-11-23 13:02:42,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:42" (3/3) ... [2018-11-23 13:02:42,782 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_false-unreach-call_true-termination.i [2018-11-23 13:02:42,791 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:42,798 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:42,813 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:42,847 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:42,848 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:42,848 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:42,848 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:42,849 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:42,849 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:42,849 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:42,849 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:42,850 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:02:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:42,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:42,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:42,878 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:42,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:42,885 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:02:42,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:42,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:42,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:42,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:42,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:02:43,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:02:43,047 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2018-11-23 13:02:43,047 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 13:02:43,047 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2018-11-23 13:02:43,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:02:43,060 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:02:43,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:02:43,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:02:43,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:02:43,063 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-23 13:02:43,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:43,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:43,071 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:43,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:43,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:43,155 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-23 13:02:43,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:43,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:43,166 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:02:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,236 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 13:02:43,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:43,236 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:02:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:02:43,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:02:43,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:43,474 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:02:43,475 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:02:43,478 INFO L631 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-23 13:02:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:02:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:02:43,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:43,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:43,588 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:43,588 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,591 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:02:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:43,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,592 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:43,592 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,595 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:02:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:43,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:43,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:02:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:02:43,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:02:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:43,601 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:02:43,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:43,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:43,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:43,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:43,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 13:02:43,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:43,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:43,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:02:43,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:02:43,831 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #37#return; {111#true} is VALID [2018-11-23 13:02:43,832 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret2 := main(); {111#true} is VALID [2018-11-23 13:02:43,833 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:43,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(= main_~sn~0 0)} assume !(~i~0 <= ~n~0); {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:43,836 INFO L256 TraceCheckUtils]: 6: Hoare triple {113#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {114#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:02:43,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {114#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {115#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:02:43,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {115#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:02:43,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:02:43,840 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-23 13:02:43,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:43,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:43,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:02:43,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:43,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:43,894 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-23 13:02:43,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:43,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:43,896 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 13:02:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,242 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:02:44,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:44,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:02:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:02:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:02:44,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 13:02:44,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:44,303 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:02:44,303 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:02:44,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:02:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:02:44,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:44,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:02:44,317 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:02:44,317 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:02:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,319 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:02:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:02:44,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:44,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:44,320 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:02:44,320 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:02:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,322 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:02:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:02:44,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:44,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:44,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:44,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:02:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 13:02:44,326 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 13:02:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:44,326 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 13:02:44,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:02:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:02:44,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:44,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:44,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:44,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2018-11-23 13:02:44,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:44,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:44,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:44,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:44,739 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-11-23 13:02:45,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-23 13:02:45,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-23 13:02:45,149 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #37#return; {207#true} is VALID [2018-11-23 13:02:45,149 INFO L256 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret2 := main(); {207#true} is VALID [2018-11-23 13:02:45,167 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {209#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:45,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {210#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} is VALID [2018-11-23 13:02:45,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {210#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {211#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-23 13:02:45,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {211#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {212#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-23 13:02:45,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {212#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {213#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-23 13:02:45,191 INFO L256 TraceCheckUtils]: 9: Hoare triple {213#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {214#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:45,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {215#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:45,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {208#false} is VALID [2018-11-23 13:02:45,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-23 13:02:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:45,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:45,196 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-23 13:02:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:45,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:45,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-23 13:02:45,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-23 13:02:45,579 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #37#return; {207#true} is VALID [2018-11-23 13:02:45,579 INFO L256 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret2 := main(); {207#true} is VALID [2018-11-23 13:02:45,580 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {231#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-23 13:02:45,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {235#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-23 13:02:45,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {235#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 0 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {239#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:45,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {243#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:45,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {243#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} assume !(~i~0 <= ~n~0); {247#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:45,602 INFO L256 TraceCheckUtils]: 9: Hoare triple {247#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {214#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:45,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {215#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:45,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {208#false} is VALID [2018-11-23 13:02:45,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-23 13:02:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:45,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:45,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:02:45,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 13:02:45,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:45,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:02:45,784 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-23 13:02:45,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:02:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:02:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:02:45,785 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 14 states. [2018-11-23 13:02:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:46,425 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 13:02:46,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:02:46,425 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 13:02:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2018-11-23 13:02:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2018-11-23 13:02:46,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2018-11-23 13:02:46,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:46,507 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:02:46,507 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:02:46,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:02:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:02:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 13:02:46,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:46,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2018-11-23 13:02:46,535 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2018-11-23 13:02:46,535 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2018-11-23 13:02:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:46,538 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:02:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:02:46,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:46,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:46,539 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2018-11-23 13:02:46,539 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2018-11-23 13:02:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:46,541 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:02:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:02:46,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:46,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:46,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:46,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:02:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:02:46,545 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-11-23 13:02:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:46,545 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:02:46,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:02:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:02:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:02:46,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:46,547 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:46,547 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:46,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1350121109, now seen corresponding path program 1 times [2018-11-23 13:02:46,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:46,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:46,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2018-11-23 13:02:46,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {395#true} assume true; {395#true} is VALID [2018-11-23 13:02:46,647 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {395#true} {395#true} #37#return; {395#true} is VALID [2018-11-23 13:02:46,647 INFO L256 TraceCheckUtils]: 3: Hoare triple {395#true} call #t~ret2 := main(); {395#true} is VALID [2018-11-23 13:02:46,648 INFO L273 TraceCheckUtils]: 4: Hoare triple {395#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {397#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:46,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {397#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:46,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {397#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:46,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {398#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:46,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {398#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {398#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:46,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {398#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {398#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:46,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {398#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {399#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:46,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {399#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {399#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:46,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {399#(<= main_~i~0 3)} assume !(~i~0 < 10); {396#false} is VALID [2018-11-23 13:02:46,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {396#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {396#false} is VALID [2018-11-23 13:02:46,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {396#false} assume !(~i~0 <= ~n~0); {396#false} is VALID [2018-11-23 13:02:46,659 INFO L256 TraceCheckUtils]: 15: Hoare triple {396#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {396#false} is VALID [2018-11-23 13:02:46,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {396#false} ~cond := #in~cond; {396#false} is VALID [2018-11-23 13:02:46,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {396#false} assume 0 == ~cond; {396#false} is VALID [2018-11-23 13:02:46,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {396#false} assume !false; {396#false} is VALID [2018-11-23 13:02:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:46,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:46,662 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-23 13:02:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:46,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:46,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2018-11-23 13:02:46,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {395#true} assume true; {395#true} is VALID [2018-11-23 13:02:46,834 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {395#true} {395#true} #37#return; {395#true} is VALID [2018-11-23 13:02:46,835 INFO L256 TraceCheckUtils]: 3: Hoare triple {395#true} call #t~ret2 := main(); {395#true} is VALID [2018-11-23 13:02:46,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {395#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {397#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:46,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {397#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:46,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {397#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:46,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {398#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:46,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {398#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {398#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:46,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {398#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {398#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:46,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {398#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {399#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:46,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {399#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {399#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:46,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {399#(<= main_~i~0 3)} assume !(~i~0 < 10); {396#false} is VALID [2018-11-23 13:02:46,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {396#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {396#false} is VALID [2018-11-23 13:02:46,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {396#false} assume !(~i~0 <= ~n~0); {396#false} is VALID [2018-11-23 13:02:46,843 INFO L256 TraceCheckUtils]: 15: Hoare triple {396#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {396#false} is VALID [2018-11-23 13:02:46,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {396#false} ~cond := #in~cond; {396#false} is VALID [2018-11-23 13:02:46,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {396#false} assume 0 == ~cond; {396#false} is VALID [2018-11-23 13:02:46,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {396#false} assume !false; {396#false} is VALID [2018-11-23 13:02:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:46,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:46,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 13:02:46,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:02:46,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:46,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:46,885 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-23 13:02:46,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:46,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:46,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:46,886 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-23 13:02:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:47,060 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:02:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:47,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 13:02:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 13:02:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-23 13:02:47,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2018-11-23 13:02:47,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:47,107 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:02:47,107 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:02:47,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:02:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:02:47,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:47,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:02:47,131 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:02:47,131 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:02:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:47,134 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 13:02:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 13:02:47,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:47,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:47,135 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:02:47,136 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:02:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:47,138 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 13:02:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 13:02:47,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:47,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:47,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:47,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:02:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 13:02:47,141 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 13:02:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:47,141 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 13:02:47,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 13:02:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:02:47,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:47,143 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:47,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:47,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 2 times [2018-11-23 13:02:47,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:47,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:47,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:47,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:47,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2018-11-23 13:02:47,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-23 13:02:47,668 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {574#true} {574#true} #37#return; {574#true} is VALID [2018-11-23 13:02:47,668 INFO L256 TraceCheckUtils]: 3: Hoare triple {574#true} call #t~ret2 := main(); {574#true} is VALID [2018-11-23 13:02:47,670 INFO L273 TraceCheckUtils]: 4: Hoare triple {574#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:47,670 INFO L273 TraceCheckUtils]: 5: Hoare triple {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:47,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {577#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:02:47,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {577#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:47,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:47,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {577#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:02:47,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {577#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:47,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {576#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {578#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} is VALID [2018-11-23 13:02:47,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {578#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {579#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-23 13:02:47,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-23 13:02:47,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {580#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {581#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-23 13:02:47,687 INFO L256 TraceCheckUtils]: 15: Hoare triple {581#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {582#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:47,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {582#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {583#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:47,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {583#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {575#false} is VALID [2018-11-23 13:02:47,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {575#false} assume !false; {575#false} is VALID [2018-11-23 13:02:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:02:47,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:47,691 INFO L223 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-23 13:02:47,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:47,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:47,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:47,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:48,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2018-11-23 13:02:48,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-23 13:02:48,298 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {574#true} {574#true} #37#return; {574#true} is VALID [2018-11-23 13:02:48,299 INFO L256 TraceCheckUtils]: 3: Hoare triple {574#true} call #t~ret2 := main(); {574#true} is VALID [2018-11-23 13:02:48,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {574#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {599#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-23 13:02:48,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {599#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-23 13:02:48,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {599#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {606#(and (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:48,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(and (= main_~i~0 1) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {610#(and (= main_~i~0 2) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:48,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {610#(and (= main_~i~0 2) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {610#(and (= main_~i~0 2) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:48,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {610#(and (= main_~i~0 2) (= 2 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {617#(and (= 4 main_~sn~0) (= main_~i~0 2))} is VALID [2018-11-23 13:02:48,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {617#(and (= 4 main_~sn~0) (= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {621#(and (= 4 main_~sn~0) (= main_~i~0 3))} is VALID [2018-11-23 13:02:48,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#(and (= 4 main_~sn~0) (= main_~i~0 3))} assume !!(~i~0 <= ~n~0); {625#(and (= 4 main_~sn~0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} is VALID [2018-11-23 13:02:48,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#(and (= 4 main_~sn~0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {629#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:48,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {629#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {633#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:48,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} assume !(~i~0 <= ~n~0); {637#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:48,322 INFO L256 TraceCheckUtils]: 15: Hoare triple {637#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= 6 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {582#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:48,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {582#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {583#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:48,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {583#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {575#false} is VALID [2018-11-23 13:02:48,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {575#false} assume !false; {575#false} is VALID [2018-11-23 13:02:48,326 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-23 13:02:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:48,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2018-11-23 13:02:48,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 13:02:48,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:48,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:02:48,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:48,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:02:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:02:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:02:48,404 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 19 states. [2018-11-23 13:02:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:49,667 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 13:02:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:02:49,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 13:02:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:02:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2018-11-23 13:02:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:02:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2018-11-23 13:02:49,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2018-11-23 13:02:49,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:49,725 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:02:49,725 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:02:49,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:02:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:02:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:02:49,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:49,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 13:02:49,786 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 13:02:49,787 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 13:02:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:49,789 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 13:02:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:02:49,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:49,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:49,790 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 13:02:49,790 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 13:02:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:49,793 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 13:02:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:02:49,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:49,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:49,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:49,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:02:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 13:02:49,796 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2018-11-23 13:02:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:49,796 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 13:02:49,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:02:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:02:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:02:49,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:49,798 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:49,798 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:49,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1753373675, now seen corresponding path program 2 times [2018-11-23 13:02:49,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:49,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:49,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:49,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-23 13:02:49,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-23 13:02:49,944 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {830#true} {830#true} #37#return; {830#true} is VALID [2018-11-23 13:02:49,945 INFO L256 TraceCheckUtils]: 3: Hoare triple {830#true} call #t~ret2 := main(); {830#true} is VALID [2018-11-23 13:02:49,946 INFO L273 TraceCheckUtils]: 4: Hoare triple {830#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {832#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:49,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {832#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {832#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:49,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {832#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {832#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:49,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {833#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:49,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {833#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {833#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:49,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {833#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:49,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {834#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:49,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {834#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {834#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:49,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {834#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {834#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:49,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {834#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {835#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:49,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {835#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {835#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:49,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {835#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {835#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:49,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {835#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {836#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:49,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {836#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {836#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:49,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {836#(<= main_~i~0 5)} assume !(~i~0 < 10); {831#false} is VALID [2018-11-23 13:02:49,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {831#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {831#false} is VALID [2018-11-23 13:02:49,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {831#false} assume !(~i~0 <= ~n~0); {831#false} is VALID [2018-11-23 13:02:49,965 INFO L256 TraceCheckUtils]: 21: Hoare triple {831#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {831#false} is VALID [2018-11-23 13:02:49,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2018-11-23 13:02:49,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2018-11-23 13:02:49,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-23 13:02:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:49,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:49,968 INFO L223 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-23 13:02:49,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:49,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:49,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:50,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:50,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-23 13:02:50,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-23 13:02:50,159 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {830#true} {830#true} #37#return; {830#true} is VALID [2018-11-23 13:02:50,159 INFO L256 TraceCheckUtils]: 3: Hoare triple {830#true} call #t~ret2 := main(); {830#true} is VALID [2018-11-23 13:02:50,161 INFO L273 TraceCheckUtils]: 4: Hoare triple {830#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {832#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {832#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {832#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {832#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {832#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {833#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:50,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {833#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {833#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:50,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {833#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:50,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {834#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:50,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {834#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {834#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:50,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {834#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {834#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:50,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {834#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {835#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:50,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {835#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {835#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:50,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {835#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {835#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:50,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {835#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {836#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:50,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {836#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {836#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:50,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {836#(<= main_~i~0 5)} assume !(~i~0 < 10); {831#false} is VALID [2018-11-23 13:02:50,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {831#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {831#false} is VALID [2018-11-23 13:02:50,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {831#false} assume !(~i~0 <= ~n~0); {831#false} is VALID [2018-11-23 13:02:50,173 INFO L256 TraceCheckUtils]: 21: Hoare triple {831#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {831#false} is VALID [2018-11-23 13:02:50,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2018-11-23 13:02:50,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2018-11-23 13:02:50,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-23 13:02:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:50,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 13:02:50,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 13:02:50,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:50,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:02:50,254 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-23 13:02:50,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:02:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:02:50,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:50,255 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2018-11-23 13:02:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,431 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:02:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:02:50,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 13:02:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:02:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:02:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:02:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:02:50,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2018-11-23 13:02:50,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:50,554 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:02:50,554 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:02:50,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:02:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:02:50,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:50,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:02:50,606 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:02:50,606 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:02:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,608 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:02:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:02:50,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:50,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:50,609 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:02:50,609 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:02:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,611 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:02:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:02:50,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:50,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:50,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:50,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:02:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 13:02:50,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-11-23 13:02:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:50,615 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:02:50,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:02:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 13:02:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:02:50,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:50,616 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:50,617 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:50,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958777, now seen corresponding path program 3 times [2018-11-23 13:02:50,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:50,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:50,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2018-11-23 13:02:50,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {1071#true} assume true; {1071#true} is VALID [2018-11-23 13:02:50,793 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1071#true} {1071#true} #37#return; {1071#true} is VALID [2018-11-23 13:02:50,793 INFO L256 TraceCheckUtils]: 3: Hoare triple {1071#true} call #t~ret2 := main(); {1071#true} is VALID [2018-11-23 13:02:50,794 INFO L273 TraceCheckUtils]: 4: Hoare triple {1071#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1073#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {1073#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1073#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {1073#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1073#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {1073#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1074#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:50,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {1074#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1074#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:50,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1074#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:50,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {1074#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1075#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:50,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1075#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:50,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {1075#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1075#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:50,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {1075#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1076#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:50,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {1076#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1076#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:50,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {1076#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1076#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:50,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {1076#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1077#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:50,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {1077#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1077#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:50,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {1077#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1077#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:50,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {1077#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1078#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:50,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {1078#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1078#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:50,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {1078#(<= main_~i~0 6)} assume !(~i~0 < 10); {1072#false} is VALID [2018-11-23 13:02:50,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1072#false} is VALID [2018-11-23 13:02:50,814 INFO L273 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(~i~0 <= ~n~0); {1072#false} is VALID [2018-11-23 13:02:50,815 INFO L256 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1072#false} is VALID [2018-11-23 13:02:50,815 INFO L273 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2018-11-23 13:02:50,815 INFO L273 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2018-11-23 13:02:50,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2018-11-23 13:02:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:50,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:50,817 INFO L223 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-23 13:02:50,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:02:50,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 13:02:50,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:50,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:51,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2018-11-23 13:02:51,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {1071#true} assume true; {1071#true} is VALID [2018-11-23 13:02:51,009 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1071#true} {1071#true} #37#return; {1071#true} is VALID [2018-11-23 13:02:51,009 INFO L256 TraceCheckUtils]: 3: Hoare triple {1071#true} call #t~ret2 := main(); {1071#true} is VALID [2018-11-23 13:02:51,015 INFO L273 TraceCheckUtils]: 4: Hoare triple {1071#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1073#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {1073#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1073#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {1073#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1073#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {1073#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1074#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {1074#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1074#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {1074#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1074#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {1074#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1075#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:51,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {1075#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1075#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:51,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {1075#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1075#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:51,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {1075#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1076#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {1076#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1076#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {1076#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1076#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {1076#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1077#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:51,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {1077#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1077#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:51,037 INFO L273 TraceCheckUtils]: 18: Hoare triple {1077#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1077#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:51,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {1077#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1078#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:51,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {1078#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1078#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:51,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {1078#(<= main_~i~0 6)} assume !(~i~0 < 10); {1072#false} is VALID [2018-11-23 13:02:51,041 INFO L273 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1072#false} is VALID [2018-11-23 13:02:51,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(~i~0 <= ~n~0); {1072#false} is VALID [2018-11-23 13:02:51,042 INFO L256 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1072#false} is VALID [2018-11-23 13:02:51,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2018-11-23 13:02:51,042 INFO L273 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2018-11-23 13:02:51,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2018-11-23 13:02:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:51,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 13:02:51,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 13:02:51,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:51,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:02:51,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:51,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:02:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:02:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:02:51,261 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-11-23 13:02:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,523 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 13:02:51,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:02:51,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 13:02:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:02:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-23 13:02:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:02:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-23 13:02:51,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2018-11-23 13:02:51,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:51,671 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:02:51,671 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:02:51,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:02:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:02:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:02:51,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:51,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 13:02:51,702 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 13:02:51,702 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 13:02:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,704 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 13:02:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 13:02:51,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:51,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:51,705 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 13:02:51,705 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 13:02:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,707 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 13:02:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 13:02:51,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:51,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:51,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:51,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:02:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 13:02:51,710 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2018-11-23 13:02:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:51,710 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 13:02:51,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:02:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:02:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:02:51,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:51,711 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:51,712 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:51,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 98169237, now seen corresponding path program 4 times [2018-11-23 13:02:51,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:51,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:51,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1336#true} is VALID [2018-11-23 13:02:51,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2018-11-23 13:02:51,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #37#return; {1336#true} is VALID [2018-11-23 13:02:51,889 INFO L256 TraceCheckUtils]: 3: Hoare triple {1336#true} call #t~ret2 := main(); {1336#true} is VALID [2018-11-23 13:02:51,890 INFO L273 TraceCheckUtils]: 4: Hoare triple {1336#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1338#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {1338#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1338#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {1338#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1338#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {1338#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1339#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {1339#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1339#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {1339#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1339#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1340#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:51,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {1340#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1340#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:51,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {1340#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1340#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:51,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {1340#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1341#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {1341#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1341#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {1341#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1341#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {1341#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1342#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:51,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {1342#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1342#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:51,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {1342#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1342#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:51,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {1342#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1343#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:51,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {1343#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1343#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:51,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {1343#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1343#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:51,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {1343#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1344#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:51,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {1344#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1344#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:51,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {1344#(<= main_~i~0 7)} assume !(~i~0 < 10); {1337#false} is VALID [2018-11-23 13:02:51,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {1337#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1337#false} is VALID [2018-11-23 13:02:51,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {1337#false} assume !(~i~0 <= ~n~0); {1337#false} is VALID [2018-11-23 13:02:51,909 INFO L256 TraceCheckUtils]: 27: Hoare triple {1337#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1337#false} is VALID [2018-11-23 13:02:51,909 INFO L273 TraceCheckUtils]: 28: Hoare triple {1337#false} ~cond := #in~cond; {1337#false} is VALID [2018-11-23 13:02:51,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {1337#false} assume 0 == ~cond; {1337#false} is VALID [2018-11-23 13:02:51,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2018-11-23 13:02:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:51,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:51,912 INFO L223 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-23 13:02:51,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:02:51,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:02:51,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:51,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:52,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1336#true} is VALID [2018-11-23 13:02:52,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2018-11-23 13:02:52,073 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #37#return; {1336#true} is VALID [2018-11-23 13:02:52,073 INFO L256 TraceCheckUtils]: 3: Hoare triple {1336#true} call #t~ret2 := main(); {1336#true} is VALID [2018-11-23 13:02:52,074 INFO L273 TraceCheckUtils]: 4: Hoare triple {1336#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1338#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:52,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {1338#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1338#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:52,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {1338#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1338#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:52,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {1338#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1339#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:52,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {1339#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1339#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:52,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {1339#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1339#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:52,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {1339#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1340#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {1340#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1340#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {1340#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1340#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {1340#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1341#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {1341#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1341#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {1341#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1341#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {1341#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1342#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {1342#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1342#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {1342#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1342#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {1342#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1343#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {1343#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1343#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {1343#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1343#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {1343#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1344#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:52,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {1344#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1344#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:52,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {1344#(<= main_~i~0 7)} assume !(~i~0 < 10); {1337#false} is VALID [2018-11-23 13:02:52,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {1337#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1337#false} is VALID [2018-11-23 13:02:52,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {1337#false} assume !(~i~0 <= ~n~0); {1337#false} is VALID [2018-11-23 13:02:52,090 INFO L256 TraceCheckUtils]: 27: Hoare triple {1337#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1337#false} is VALID [2018-11-23 13:02:52,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {1337#false} ~cond := #in~cond; {1337#false} is VALID [2018-11-23 13:02:52,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {1337#false} assume 0 == ~cond; {1337#false} is VALID [2018-11-23 13:02:52,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2018-11-23 13:02:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:52,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:52,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 13:02:52,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 13:02:52,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:52,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:02:52,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:02:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:02:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:02:52,170 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2018-11-23 13:02:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,331 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 13:02:52,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:02:52,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-23 13:02:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:02:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2018-11-23 13:02:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:02:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2018-11-23 13:02:52,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2018-11-23 13:02:52,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,470 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:02:52,470 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:02:52,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:02:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:02:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 13:02:52,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:52,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 13:02:52,515 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 13:02:52,516 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 13:02:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,519 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 13:02:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 13:02:52,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,520 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 13:02:52,520 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 13:02:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,522 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 13:02:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 13:02:52,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:52,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:02:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 13:02:52,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-11-23 13:02:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:52,525 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 13:02:52,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:02:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:02:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:02:52,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:52,527 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:52,527 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:52,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash 144867641, now seen corresponding path program 5 times [2018-11-23 13:02:52,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:52,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:52,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:52,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {1625#true} call ULTIMATE.init(); {1625#true} is VALID [2018-11-23 13:02:52,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {1625#true} assume true; {1625#true} is VALID [2018-11-23 13:02:52,871 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1625#true} {1625#true} #37#return; {1625#true} is VALID [2018-11-23 13:02:52,871 INFO L256 TraceCheckUtils]: 3: Hoare triple {1625#true} call #t~ret2 := main(); {1625#true} is VALID [2018-11-23 13:02:52,872 INFO L273 TraceCheckUtils]: 4: Hoare triple {1625#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1627#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:52,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {1627#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1627#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:52,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {1627#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1627#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:52,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {1627#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1628#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:52,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {1628#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1628#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:52,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {1628#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1628#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:52,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1629#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {1629#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1629#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {1629#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1629#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,881 INFO L273 TraceCheckUtils]: 13: Hoare triple {1629#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1630#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {1630#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1630#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {1630#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1630#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {1630#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1631#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {1631#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1631#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1631#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {1631#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1632#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {1632#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1632#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {1632#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1632#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {1632#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1633#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:52,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {1633#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1633#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:52,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {1633#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1633#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:52,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {1633#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1634#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:52,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {1634#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1634#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:52,907 INFO L273 TraceCheckUtils]: 27: Hoare triple {1634#(<= main_~i~0 8)} assume !(~i~0 < 10); {1626#false} is VALID [2018-11-23 13:02:52,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {1626#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1626#false} is VALID [2018-11-23 13:02:52,907 INFO L273 TraceCheckUtils]: 29: Hoare triple {1626#false} assume !(~i~0 <= ~n~0); {1626#false} is VALID [2018-11-23 13:02:52,907 INFO L256 TraceCheckUtils]: 30: Hoare triple {1626#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1626#false} is VALID [2018-11-23 13:02:52,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {1626#false} ~cond := #in~cond; {1626#false} is VALID [2018-11-23 13:02:52,908 INFO L273 TraceCheckUtils]: 32: Hoare triple {1626#false} assume 0 == ~cond; {1626#false} is VALID [2018-11-23 13:02:52,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {1626#false} assume !false; {1626#false} is VALID [2018-11-23 13:02:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:52,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:52,909 INFO L223 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-23 13:02:52,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:02:52,940 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 13:02:52,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:53,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {1625#true} call ULTIMATE.init(); {1625#true} is VALID [2018-11-23 13:02:53,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {1625#true} assume true; {1625#true} is VALID [2018-11-23 13:02:53,095 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1625#true} {1625#true} #37#return; {1625#true} is VALID [2018-11-23 13:02:53,096 INFO L256 TraceCheckUtils]: 3: Hoare triple {1625#true} call #t~ret2 := main(); {1625#true} is VALID [2018-11-23 13:02:53,097 INFO L273 TraceCheckUtils]: 4: Hoare triple {1625#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1627#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {1627#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1627#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {1627#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1627#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {1627#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1628#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {1628#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1628#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {1628#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1628#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1629#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {1629#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1629#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {1629#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1629#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {1629#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1630#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {1630#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1630#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {1630#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1630#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {1630#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1631#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {1631#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1631#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {1631#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1631#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {1631#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1632#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {1632#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1632#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {1632#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1632#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,117 INFO L273 TraceCheckUtils]: 22: Hoare triple {1632#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1633#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {1633#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1633#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {1633#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1633#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {1633#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1634#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,126 INFO L273 TraceCheckUtils]: 26: Hoare triple {1634#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1634#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {1634#(<= main_~i~0 8)} assume !(~i~0 < 10); {1626#false} is VALID [2018-11-23 13:02:53,127 INFO L273 TraceCheckUtils]: 28: Hoare triple {1626#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1626#false} is VALID [2018-11-23 13:02:53,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {1626#false} assume !(~i~0 <= ~n~0); {1626#false} is VALID [2018-11-23 13:02:53,127 INFO L256 TraceCheckUtils]: 30: Hoare triple {1626#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1626#false} is VALID [2018-11-23 13:02:53,127 INFO L273 TraceCheckUtils]: 31: Hoare triple {1626#false} ~cond := #in~cond; {1626#false} is VALID [2018-11-23 13:02:53,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {1626#false} assume 0 == ~cond; {1626#false} is VALID [2018-11-23 13:02:53,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {1626#false} assume !false; {1626#false} is VALID [2018-11-23 13:02:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:53,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:53,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 13:02:53,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 13:02:53,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:53,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:02:53,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:02:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:02:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:02:53,189 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-23 13:02:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,379 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 13:02:53,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:02:53,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 13:02:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:02:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2018-11-23 13:02:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:02:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2018-11-23 13:02:53,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2018-11-23 13:02:53,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,453 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:02:53,453 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:02:53,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:02:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:02:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:02:53,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:53,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 13:02:53,519 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 13:02:53,519 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 13:02:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,522 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 13:02:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 13:02:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,523 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 13:02:53,523 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 13:02:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,524 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 13:02:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 13:02:53,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:53,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:02:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 13:02:53,527 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2018-11-23 13:02:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:53,527 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:02:53,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:02:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:02:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:02:53,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:53,528 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:53,529 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:53,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash -232382699, now seen corresponding path program 6 times [2018-11-23 13:02:53,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:53,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2018-11-23 13:02:53,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {1938#true} assume true; {1938#true} is VALID [2018-11-23 13:02:53,762 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1938#true} {1938#true} #37#return; {1938#true} is VALID [2018-11-23 13:02:53,762 INFO L256 TraceCheckUtils]: 3: Hoare triple {1938#true} call #t~ret2 := main(); {1938#true} is VALID [2018-11-23 13:02:53,763 INFO L273 TraceCheckUtils]: 4: Hoare triple {1938#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {1940#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1940#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {1940#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {1940#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1941#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {1941#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1941#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {1941#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1941#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {1941#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1942#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {1942#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1942#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {1942#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1942#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {1942#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1943#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {1943#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1943#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,773 INFO L273 TraceCheckUtils]: 15: Hoare triple {1943#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1943#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {1943#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1944#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1944#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1944#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,775 INFO L273 TraceCheckUtils]: 18: Hoare triple {1944#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1944#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {1944#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1945#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {1945#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1945#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {1945#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1945#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {1945#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1946#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {1946#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1946#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {1946#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1946#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,786 INFO L273 TraceCheckUtils]: 25: Hoare triple {1946#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1947#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {1947#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1947#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {1947#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1947#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {1947#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1948#(<= main_~i~0 9)} is VALID [2018-11-23 13:02:53,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {1948#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1948#(<= main_~i~0 9)} is VALID [2018-11-23 13:02:53,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {1948#(<= main_~i~0 9)} assume !(~i~0 < 10); {1939#false} is VALID [2018-11-23 13:02:53,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {1939#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1939#false} is VALID [2018-11-23 13:02:53,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {1939#false} assume !(~i~0 <= ~n~0); {1939#false} is VALID [2018-11-23 13:02:53,793 INFO L256 TraceCheckUtils]: 33: Hoare triple {1939#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1939#false} is VALID [2018-11-23 13:02:53,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {1939#false} ~cond := #in~cond; {1939#false} is VALID [2018-11-23 13:02:53,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {1939#false} assume 0 == ~cond; {1939#false} is VALID [2018-11-23 13:02:53,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2018-11-23 13:02:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:53,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:53,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:53,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:02:53,913 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 13:02:53,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:53,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:54,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2018-11-23 13:02:54,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {1938#true} assume true; {1938#true} is VALID [2018-11-23 13:02:54,070 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1938#true} {1938#true} #37#return; {1938#true} is VALID [2018-11-23 13:02:54,071 INFO L256 TraceCheckUtils]: 3: Hoare triple {1938#true} call #t~ret2 := main(); {1938#true} is VALID [2018-11-23 13:02:54,072 INFO L273 TraceCheckUtils]: 4: Hoare triple {1938#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:54,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {1940#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1940#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:54,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {1940#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1940#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:54,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {1940#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1941#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:54,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {1941#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1941#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:54,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {1941#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1941#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:54,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {1941#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1942#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:54,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {1942#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1942#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:54,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {1942#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1942#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:54,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {1942#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1943#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:54,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {1943#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1943#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:54,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1943#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1943#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:54,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {1943#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1944#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:54,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {1944#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1944#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:54,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {1944#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1944#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:54,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {1944#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1945#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:54,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {1945#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1945#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:54,083 INFO L273 TraceCheckUtils]: 21: Hoare triple {1945#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1945#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:54,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {1945#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1946#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:54,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {1946#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1946#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:54,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {1946#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1946#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:54,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {1946#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1947#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:54,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {1947#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1947#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:54,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {1947#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1947#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:54,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {1947#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1948#(<= main_~i~0 9)} is VALID [2018-11-23 13:02:54,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {1948#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1948#(<= main_~i~0 9)} is VALID [2018-11-23 13:02:54,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {1948#(<= main_~i~0 9)} assume !(~i~0 < 10); {1939#false} is VALID [2018-11-23 13:02:54,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {1939#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1939#false} is VALID [2018-11-23 13:02:54,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {1939#false} assume !(~i~0 <= ~n~0); {1939#false} is VALID [2018-11-23 13:02:54,091 INFO L256 TraceCheckUtils]: 33: Hoare triple {1939#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1939#false} is VALID [2018-11-23 13:02:54,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {1939#false} ~cond := #in~cond; {1939#false} is VALID [2018-11-23 13:02:54,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {1939#false} assume 0 == ~cond; {1939#false} is VALID [2018-11-23 13:02:54,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2018-11-23 13:02:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:54,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:54,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 13:02:54,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 13:02:54,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:54,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:02:54,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:54,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:02:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:02:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:02:54,169 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2018-11-23 13:02:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,570 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 13:02:54,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:02:54,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-11-23 13:02:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:02:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-23 13:02:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:02:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2018-11-23 13:02:54,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2018-11-23 13:02:54,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:54,665 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:02:54,666 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:02:54,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:02:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:02:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 13:02:54,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:54,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 13:02:54,862 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 13:02:54,862 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 13:02:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,865 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:02:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:02:54,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:54,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:54,866 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 13:02:54,866 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 13:02:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,867 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:02:54,867 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:02:54,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:54,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:54,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:54,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:02:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 13:02:54,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2018-11-23 13:02:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:54,870 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 13:02:54,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:02:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 13:02:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:02:54,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:54,871 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:54,871 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:54,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1032151993, now seen corresponding path program 7 times [2018-11-23 13:02:54,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:54,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:54,950 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=8] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=10] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=12] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=14] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=16] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=4, n=10] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=10, n=6] [L13] i++ VAL [i=4, n=6, n=10] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=8, n=10] [L13] COND TRUE i<=n VAL [i=5, n=8, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=14, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=18, n=10] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:55,000 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:02:55,000 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:55,000 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:55,000 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:02:55,000 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:02:55,000 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:02:55,001 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 13:02:55,002 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:02:55,003 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:02:55,003 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:02:55,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:55 BoogieIcfgContainer [2018-11-23 13:02:55,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:55,005 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:55,005 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:55,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:55,006 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:42" (3/4) ... [2018-11-23 13:02:55,009 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=0] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=10, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=2] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=10, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=4] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=10, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=6] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=10, main_~sn~0=8] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=8] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=5, main_~n~0=10, main_~sn~0=10] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=10] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=6, main_~n~0=10, main_~sn~0=12] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=12] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=7, main_~n~0=10, main_~sn~0=14] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=14] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=8, main_~n~0=10, main_~sn~0=16] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=16] [?] assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=9, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !!(~i~0 <= ~n~0); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 < 10); VAL [main_~i~0=10, main_~n~0=10, main_~sn~0=18] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=11, main_~n~0=10, main_~sn~0=18] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14-L15] assume ~i~0 < 10; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] assume !!(~i~0 <= ~n~0); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14-L15] assume !(~i~0 < 10); VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=1, ~n~0=10, ~sn~0=0] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=10, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=2, ~n~0=10, ~sn~0=2] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=10, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=3, ~n~0=10, ~sn~0=4] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=10, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=4, ~n~0=10, ~sn~0=6] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=10, ~sn~0=8] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=5, ~n~0=10, ~sn~0=8] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=5, ~n~0=10, ~sn~0=10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=6, ~n~0=10, ~sn~0=10] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=6, ~n~0=10, ~sn~0=12] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=7, ~n~0=10, ~sn~0=12] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=7, ~n~0=10, ~sn~0=14] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=8, ~n~0=10, ~sn~0=14] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=8, ~n~0=10, ~sn~0=16] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=9, ~n~0=10, ~sn~0=16] [L14] COND TRUE ~i~0 < 10 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=9, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L14] COND FALSE !(~i~0 < 10) VAL [~i~0=10, ~n~0=10, ~sn~0=18] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=11, ~n~0=10, ~sn~0=18] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=2, n=10] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=4, n=10] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=10, n=6] [L13] i++ VAL [i=4, n=6, n=10] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=14, n=10] [L13] i++ VAL [i=8, n=10, n=14] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=10, n=16] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=10, n=18] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=18, n=10] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:55,090 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum01_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:02:55,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:55,095 INFO L168 Benchmark]: Toolchain (without parser) took 13403.05 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -528.9 MB). Peak memory consumption was 337.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:55,096 INFO L168 Benchmark]: CDTParser took 0.20 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-23 13:02:55,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.92 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-23 13:02:55,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.86 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-23 13:02:55,097 INFO L168 Benchmark]: Boogie Preprocessor took 38.80 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-23 13:02:55,097 INFO L168 Benchmark]: RCFGBuilder took 731.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:55,098 INFO L168 Benchmark]: TraceAbstraction took 12230.51 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 246.3 MB). Peak memory consumption was 374.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:55,098 INFO L168 Benchmark]: Witness Printer took 84.88 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:55,101 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.20 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 280.92 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 27.86 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 38.80 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 731.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12230.51 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 246.3 MB). Peak memory consumption was 374.2 MB. Max. memory is 7.1 GB. * Witness Printer took 84.88 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=4, n=10] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=10, n=6] [L13] i++ VAL [i=4, n=6, n=10] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=8, n=10] [L13] COND TRUE i<=n VAL [i=5, n=8, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=14, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=18, n=10] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 12.1s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 63 SDslu, 347 SDs, 0 SdLazy, 416 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, 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.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 29790 SizeOfPredicates, 12 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 145/780 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...