java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:17:21,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:17:21,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:17:21,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:17:21,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:17:21,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:17:21,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:17:21,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:17:21,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:17:21,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:17:21,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:17:21,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:17:21,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:17:21,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:17:21,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:17:21,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:17:21,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:17:21,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:17:21,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:17:21,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:17:21,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:17:21,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:17:21,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:17:21,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:17:21,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:17:21,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:17:21,652 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:17:21,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:17:21,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:17:21,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:17:21,659 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:17:21,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:17:21,660 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:17:21,660 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:17:21,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:17:21,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:17:21,662 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:17:21,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:17:21,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:17:21,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:17:21,677 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:17:21,678 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:17:21,678 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:17:21,678 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:17:21,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:17:21,679 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:17:21,679 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:17:21,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:17:21,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:17:21,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:17:21,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:17:21,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:17:21,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:17:21,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:17:21,680 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:17:21,681 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:17:21,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:17:21,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:17:21,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:17:21,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:17:21,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:17:21,682 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:17:21,682 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:17:21,682 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:17:21,682 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:17:21,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:17:21,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:17:21,683 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:17:21,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:17:21,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:17:21,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:17:21,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:17:21,769 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:17:21,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-14 19:17:21,830 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940d18efe/f7cd53d67f194a81a93420a7570b6cc7/FLAG607d6f6a8 [2018-11-14 19:17:22,277 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:17:22,278 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-14 19:17:22,289 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940d18efe/f7cd53d67f194a81a93420a7570b6cc7/FLAG607d6f6a8 [2018-11-14 19:17:22,305 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940d18efe/f7cd53d67f194a81a93420a7570b6cc7 [2018-11-14 19:17:22,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:17:22,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:17:22,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:22,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:17:22,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:17:22,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@953b852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22, skipping insertion in model container [2018-11-14 19:17:22,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:17:22,369 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:17:22,627 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:22,634 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:17:22,656 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:22,680 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:17:22,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22 WrapperNode [2018-11-14 19:17:22,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:22,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:17:22,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:17:22,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:17:22,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (1/1) ... [2018-11-14 19:17:22,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:17:22,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:17:22,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:17:22,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:17:22,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (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-14 19:17:22,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:17:22,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:17:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:17:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:17:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:17:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:17:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 19:17:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:17:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:17:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:17:23,318 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:17:23,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:23 BoogieIcfgContainer [2018-11-14 19:17:23,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:17:23,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:17:23,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:17:23,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:17:23,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:17:22" (1/3) ... [2018-11-14 19:17:23,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa9b264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:23, skipping insertion in model container [2018-11-14 19:17:23,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:22" (2/3) ... [2018-11-14 19:17:23,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa9b264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:23, skipping insertion in model container [2018-11-14 19:17:23,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:23" (3/3) ... [2018-11-14 19:17:23,330 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_false-unreach-call_true-termination.i [2018-11-14 19:17:23,341 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:17:23,349 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:17:23,368 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:17:23,401 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:17:23,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:17:23,402 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:17:23,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:17:23,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:17:23,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:17:23,403 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:17:23,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:17:23,403 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:17:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-14 19:17:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:17:23,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:23,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:23,435 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:23,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2007171518, now seen corresponding path program 1 times [2018-11-14 19:17:23,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:23,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:23,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:23,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:23,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:23,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-14 19:17:23,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-14 19:17:23,573 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #40#return; {24#true} is VALID [2018-11-14 19:17:23,573 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-14 19:17:23,573 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;~j~0 := 10;~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; {24#true} is VALID [2018-11-14 19:17:23,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-14 19:17:23,575 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {25#false} is VALID [2018-11-14 19:17:23,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-14 19:17:23,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume ~cond == 0; {25#false} is VALID [2018-11-14 19:17:23,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-14 19:17:23,579 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-14 19:17:23,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:23,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:17:23,588 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:17:23,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:23,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:17:23,656 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-14 19:17:23,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:17:23,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:17:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:17:23,669 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-14 19:17:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:23,763 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 19:17:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:17:23,763 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:17:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 19:17:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 19:17:23,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-14 19:17:24,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:24,098 INFO L225 Difference]: With dead ends: 32 [2018-11-14 19:17:24,098 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 19:17:24,102 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:17:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 19:17:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 19:17:24,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:24,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 19:17:24,233 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:17:24,233 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:17:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:24,237 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 19:17:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 19:17:24,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:24,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:24,239 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 19:17:24,239 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 19:17:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:24,243 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 19:17:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 19:17:24,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:24,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:24,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:24,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 19:17:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-14 19:17:24,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-14 19:17:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:24,249 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-14 19:17:24,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:17:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 19:17:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:17:24,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:24,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:24,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:24,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1715017247, now seen corresponding path program 1 times [2018-11-14 19:17:24,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:24,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:24,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:24,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2018-11-14 19:17:24,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2018-11-14 19:17:24,509 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #40#return; {121#true} is VALID [2018-11-14 19:17:24,509 INFO L256 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret3 := main(); {121#true} is VALID [2018-11-14 19:17:24,519 INFO L273 TraceCheckUtils]: 4: Hoare triple {121#true} havoc ~i~0;~j~0 := 10;~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; {123#(= main_~sn~0 0)} is VALID [2018-11-14 19:17:24,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {123#(= main_~sn~0 0)} assume true; {123#(= main_~sn~0 0)} is VALID [2018-11-14 19:17:24,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {123#(= main_~sn~0 0)} assume !(~i~0 <= ~n~0); {123#(= main_~sn~0 0)} is VALID [2018-11-14 19:17:24,536 INFO L256 TraceCheckUtils]: 7: Hoare triple {123#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {124#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 19:17:24,536 INFO L273 TraceCheckUtils]: 8: Hoare triple {124#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {125#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:17:24,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {125#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {122#false} is VALID [2018-11-14 19:17:24,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {122#false} assume !false; {122#false} is VALID [2018-11-14 19:17:24,539 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-14 19:17:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:17:24,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 19:17:24,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:24,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:17:24,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:24,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:17:24,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:17:24,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:17:24,591 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-11-14 19:17:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:24,927 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 19:17:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:17:24,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 19:17:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-14 19:17:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-14 19:17:24,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2018-11-14 19:17:24,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:24,993 INFO L225 Difference]: With dead ends: 25 [2018-11-14 19:17:24,993 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 19:17:24,994 INFO L604 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-14 19:17:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 19:17:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 19:17:25,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:25,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 19:17:25,017 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 19:17:25,017 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 19:17:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:25,019 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-14 19:17:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-14 19:17:25,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:25,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:25,020 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 19:17:25,020 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 19:17:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:25,023 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-14 19:17:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-14 19:17:25,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:25,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:25,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:25,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:17:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-14 19:17:25,027 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2018-11-14 19:17:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:25,027 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-14 19:17:25,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:17:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-14 19:17:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:17:25,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:25,029 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:25,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:25,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1428843034, now seen corresponding path program 1 times [2018-11-14 19:17:25,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:25,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:25,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:25,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:25,613 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-11-14 19:17:25,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2018-11-14 19:17:25,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {233#true} assume true; {233#true} is VALID [2018-11-14 19:17:25,900 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {233#true} {233#true} #40#return; {233#true} is VALID [2018-11-14 19:17:25,901 INFO L256 TraceCheckUtils]: 3: Hoare triple {233#true} call #t~ret3 := main(); {233#true} is VALID [2018-11-14 19:17:25,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {233#true} havoc ~i~0;~j~0 := 10;~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; {235#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:25,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {235#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {235#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:25,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {235#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {236#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} is VALID [2018-11-14 19:17:25,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {236#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {237#(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-14 19:17:25,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {237#(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~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {237#(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-14 19:17:25,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {237#(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 := #t~post1 + 1;havoc #t~post1; {238#(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-14 19:17:25,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#(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 true; {238#(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-14 19:17:25,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {238#(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); {239#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-14 19:17:25,910 INFO L256 TraceCheckUtils]: 12: Hoare triple {239#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {240#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:17:25,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {240#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {241#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:17:25,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {234#false} is VALID [2018-11-14 19:17:25,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {234#false} assume !false; {234#false} is VALID [2018-11-14 19:17:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:25,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:17:25,918 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-14 19:17:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:25,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:26,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2018-11-14 19:17:26,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {233#true} assume true; {233#true} is VALID [2018-11-14 19:17:26,369 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {233#true} {233#true} #40#return; {233#true} is VALID [2018-11-14 19:17:26,369 INFO L256 TraceCheckUtils]: 3: Hoare triple {233#true} call #t~ret3 := main(); {233#true} is VALID [2018-11-14 19:17:26,370 INFO L273 TraceCheckUtils]: 4: Hoare triple {233#true} havoc ~i~0;~j~0 := 10;~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; {257#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-14 19:17:26,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {257#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume true; {257#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-14 19:17:26,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {264#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-14 19:17:26,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {264#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 0 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {268#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:26,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {268#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {268#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:26,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {268#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {275#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:26,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {275#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} assume true; {275#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:26,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {275#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} assume !(~i~0 <= ~n~0); {282#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:26,385 INFO L256 TraceCheckUtils]: 12: Hoare triple {282#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {240#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:17:26,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {240#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {241#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:17:26,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {234#false} is VALID [2018-11-14 19:17:26,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {234#false} assume !false; {234#false} is VALID [2018-11-14 19:17:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:26,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:17:26,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-14 19:17:26,425 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-14 19:17:26,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:26,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 19:17:26,533 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-14 19:17:26,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 19:17:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 19:17:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:17:26,535 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 14 states. [2018-11-14 19:17:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:27,435 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 19:17:27,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 19:17:27,436 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-14 19:17:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:17:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2018-11-14 19:17:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:17:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2018-11-14 19:17:27,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2018-11-14 19:17:27,571 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-14 19:17:27,573 INFO L225 Difference]: With dead ends: 45 [2018-11-14 19:17:27,574 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:17:27,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-14 19:17:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:17:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-14 19:17:27,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:27,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2018-11-14 19:17:27,608 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2018-11-14 19:17:27,608 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2018-11-14 19:17:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:27,611 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 19:17:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 19:17:27,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:27,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:27,613 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2018-11-14 19:17:27,613 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2018-11-14 19:17:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:27,616 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-14 19:17:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 19:17:27,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:27,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:27,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:27,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:17:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-14 19:17:27,620 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2018-11-14 19:17:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:27,621 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-14 19:17:27,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 19:17:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 19:17:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:17:27,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:27,622 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:27,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:27,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:27,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1947322111, now seen corresponding path program 1 times [2018-11-14 19:17:27,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:27,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:27,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:27,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:27,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {482#true} is VALID [2018-11-14 19:17:27,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {482#true} assume true; {482#true} is VALID [2018-11-14 19:17:27,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} #40#return; {482#true} is VALID [2018-11-14 19:17:27,742 INFO L256 TraceCheckUtils]: 3: Hoare triple {482#true} call #t~ret3 := main(); {482#true} is VALID [2018-11-14 19:17:27,743 INFO L273 TraceCheckUtils]: 4: Hoare triple {482#true} havoc ~i~0;~j~0 := 10;~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; {484#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:27,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {484#(<= (+ main_~i~0 9) main_~j~0)} assume true; {484#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:27,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {484#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {484#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:27,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {484#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:27,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {485#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2018-11-14 19:17:27,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {485#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {486#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:27,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {486#(<= (+ main_~i~0 7) main_~j~0)} assume true; {486#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:27,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {486#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {486#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:27,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {486#(<= (+ main_~i~0 7) main_~j~0)} assume !(~i~0 < ~j~0); {483#false} is VALID [2018-11-14 19:17:27,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {483#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {483#false} is VALID [2018-11-14 19:17:27,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {483#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {483#false} is VALID [2018-11-14 19:17:27,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {483#false} assume true; {483#false} is VALID [2018-11-14 19:17:27,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {483#false} assume !(~i~0 <= ~n~0); {483#false} is VALID [2018-11-14 19:17:27,758 INFO L256 TraceCheckUtils]: 17: Hoare triple {483#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {483#false} is VALID [2018-11-14 19:17:27,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {483#false} ~cond := #in~cond; {483#false} is VALID [2018-11-14 19:17:27,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {483#false} assume ~cond == 0; {483#false} is VALID [2018-11-14 19:17:27,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {483#false} assume !false; {483#false} is VALID [2018-11-14 19:17:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:27,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:17:27,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 19:17:27,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:27,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:27,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {482#true} is VALID [2018-11-14 19:17:27,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {482#true} assume true; {482#true} is VALID [2018-11-14 19:17:27,954 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {482#true} {482#true} #40#return; {482#true} is VALID [2018-11-14 19:17:27,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {482#true} call #t~ret3 := main(); {482#true} is VALID [2018-11-14 19:17:27,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {482#true} havoc ~i~0;~j~0 := 10;~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; {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:27,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume true; {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:27,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~i~0 <= ~n~0); {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:27,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:27,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {502#(and (<= main_~i~0 1) (<= 10 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {515#(and (<= main_~i~0 1) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:27,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {515#(and (<= main_~i~0 1) (<= 9 main_~j~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {519#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:27,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume true; {519#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:27,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume !!(~i~0 <= ~n~0); {519#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:27,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {519#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume !(~i~0 < ~j~0); {483#false} is VALID [2018-11-14 19:17:27,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {483#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {483#false} is VALID [2018-11-14 19:17:27,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {483#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {483#false} is VALID [2018-11-14 19:17:27,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {483#false} assume true; {483#false} is VALID [2018-11-14 19:17:27,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {483#false} assume !(~i~0 <= ~n~0); {483#false} is VALID [2018-11-14 19:17:27,965 INFO L256 TraceCheckUtils]: 17: Hoare triple {483#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {483#false} is VALID [2018-11-14 19:17:27,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {483#false} ~cond := #in~cond; {483#false} is VALID [2018-11-14 19:17:27,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {483#false} assume ~cond == 0; {483#false} is VALID [2018-11-14 19:17:27,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {483#false} assume !false; {483#false} is VALID [2018-11-14 19:17:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:27,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:17:27,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 19:17:27,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-14 19:17:27,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:27,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:17:28,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:28,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:17:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:17:28,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:17:28,030 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-11-14 19:17:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:28,322 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 19:17:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:17:28,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-14 19:17:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:17:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-14 19:17:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:17:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-14 19:17:28,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2018-11-14 19:17:28,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:28,380 INFO L225 Difference]: With dead ends: 42 [2018-11-14 19:17:28,380 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 19:17:28,381 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:17:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 19:17:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 19:17:28,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:28,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 19:17:28,404 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 19:17:28,404 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 19:17:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:28,407 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-14 19:17:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 19:17:28,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:28,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:28,409 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 19:17:28,409 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 19:17:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:28,411 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-14 19:17:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 19:17:28,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:28,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:28,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:28,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 19:17:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-14 19:17:28,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2018-11-14 19:17:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:28,415 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-14 19:17:28,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:17:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 19:17:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 19:17:28,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:28,416 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:28,416 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:28,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:28,417 INFO L82 PathProgramCache]: Analyzing trace with hash 994455866, now seen corresponding path program 2 times [2018-11-14 19:17:28,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:28,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:28,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:28,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:28,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:29,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {699#true} is VALID [2018-11-14 19:17:29,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {699#true} assume true; {699#true} is VALID [2018-11-14 19:17:29,402 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {699#true} {699#true} #40#return; {699#true} is VALID [2018-11-14 19:17:29,403 INFO L256 TraceCheckUtils]: 3: Hoare triple {699#true} call #t~ret3 := main(); {699#true} is VALID [2018-11-14 19:17:29,404 INFO L273 TraceCheckUtils]: 4: Hoare triple {699#true} havoc ~i~0;~j~0 := 10;~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; {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-14 19:17:29,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-14 19:17:29,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-14 19:17:29,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-14 19:17:29,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-14 19:17:29,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {701#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {703#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} is VALID [2018-11-14 19:17:29,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {703#(and (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= (+ main_~sn~0 2) (* 2 main_~n~0)))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {704#(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-14 19:17:29,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {704#(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~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {704#(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-14 19:17:29,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {704#(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 := #t~post1 + 1;havoc #t~post1; {705#(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-14 19:17:29,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {705#(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 true; {705#(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-14 19:17:29,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {705#(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); {706#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-14 19:17:29,433 INFO L256 TraceCheckUtils]: 22: Hoare triple {706#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {707#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:17:29,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {707#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {708#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:17:29,435 INFO L273 TraceCheckUtils]: 24: Hoare triple {708#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {700#false} is VALID [2018-11-14 19:17:29,436 INFO L273 TraceCheckUtils]: 25: Hoare triple {700#false} assume !false; {700#false} is VALID [2018-11-14 19:17:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 19:17:29,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:17:29,440 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-14 19:17:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:17:29,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:17:29,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:17:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:29,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:29,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {699#true} is VALID [2018-11-14 19:17:29,853 INFO L273 TraceCheckUtils]: 1: Hoare triple {699#true} assume true; {699#true} is VALID [2018-11-14 19:17:29,853 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {699#true} {699#true} #40#return; {699#true} is VALID [2018-11-14 19:17:29,853 INFO L256 TraceCheckUtils]: 3: Hoare triple {699#true} call #t~ret3 := main(); {699#true} is VALID [2018-11-14 19:17:29,855 INFO L273 TraceCheckUtils]: 4: Hoare triple {699#true} havoc ~i~0;~j~0 := 10;~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; {724#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-14 19:17:29,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {724#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume true; {724#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-14 19:17:29,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {724#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {724#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-14 19:17:29,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {724#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {734#(and (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:29,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {734#(and (= main_~i~0 1) (= 2 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {734#(and (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:29,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {734#(and (= main_~i~0 1) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {741#(and (= main_~i~0 2) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:29,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {741#(and (= main_~i~0 2) (= 2 main_~sn~0))} assume true; {741#(and (= main_~i~0 2) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:29,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {741#(and (= main_~i~0 2) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {741#(and (= main_~i~0 2) (= 2 main_~sn~0))} is VALID [2018-11-14 19:17:29,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {741#(and (= main_~i~0 2) (= 2 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {751#(and (= 4 main_~sn~0) (= main_~i~0 2))} is VALID [2018-11-14 19:17:29,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {751#(and (= 4 main_~sn~0) (= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {751#(and (= 4 main_~sn~0) (= main_~i~0 2))} is VALID [2018-11-14 19:17:29,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {751#(and (= 4 main_~sn~0) (= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {758#(and (= 4 main_~sn~0) (= main_~i~0 3))} is VALID [2018-11-14 19:17:29,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {758#(and (= 4 main_~sn~0) (= main_~i~0 3))} assume true; {758#(and (= 4 main_~sn~0) (= main_~i~0 3))} is VALID [2018-11-14 19:17:29,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {758#(and (= 4 main_~sn~0) (= main_~i~0 3))} assume !!(~i~0 <= ~n~0); {765#(and (= 4 main_~sn~0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} is VALID [2018-11-14 19:17:29,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {765#(and (= 4 main_~sn~0) (= main_~i~0 3) (<= main_~i~0 main_~n~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {769#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2018-11-14 19:17:29,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {769#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {769#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2018-11-14 19:17:29,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {769#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {776#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} is VALID [2018-11-14 19:17:29,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {776#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} assume true; {776#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} is VALID [2018-11-14 19:17:29,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {776#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} assume !(~i~0 <= ~n~0); {783#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= 6 main_~sn~0))} is VALID [2018-11-14 19:17:29,889 INFO L256 TraceCheckUtils]: 22: Hoare triple {783#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= 6 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {707#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:17:29,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {707#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {708#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:17:29,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {708#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {700#false} is VALID [2018-11-14 19:17:29,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {700#false} assume !false; {700#false} is VALID [2018-11-14 19:17:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:29,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:17:29,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2018-11-14 19:17:29,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 19:17:29,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:29,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 19:17:29,986 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-14 19:17:29,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 19:17:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 19:17:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-14 19:17:29,988 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 19 states. [2018-11-14 19:17:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:31,427 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-14 19:17:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 19:17:31,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2018-11-14 19:17:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:17:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2018-11-14 19:17:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:17:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2018-11-14 19:17:31,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2018-11-14 19:17:31,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:31,527 INFO L225 Difference]: With dead ends: 50 [2018-11-14 19:17:31,527 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 19:17:31,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 19:17:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 19:17:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-11-14 19:17:31,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:31,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 28 states. [2018-11-14 19:17:31,573 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 28 states. [2018-11-14 19:17:31,573 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 28 states. [2018-11-14 19:17:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:31,576 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 19:17:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 19:17:31,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:31,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:31,578 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 44 states. [2018-11-14 19:17:31,578 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 44 states. [2018-11-14 19:17:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:31,581 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 19:17:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 19:17:31,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:31,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:31,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:31,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 19:17:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 19:17:31,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-11-14 19:17:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:31,584 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 19:17:31,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 19:17:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 19:17:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 19:17:31,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:31,586 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:31,586 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:31,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1674514236, now seen corresponding path program 2 times [2018-11-14 19:17:31,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:31,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:31,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:31,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:17:31,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:31,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {1014#true} call ULTIMATE.init(); {1014#true} is VALID [2018-11-14 19:17:31,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {1014#true} assume true; {1014#true} is VALID [2018-11-14 19:17:31,713 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1014#true} {1014#true} #40#return; {1014#true} is VALID [2018-11-14 19:17:31,713 INFO L256 TraceCheckUtils]: 3: Hoare triple {1014#true} call #t~ret3 := main(); {1014#true} is VALID [2018-11-14 19:17:31,715 INFO L273 TraceCheckUtils]: 4: Hoare triple {1014#true} havoc ~i~0;~j~0 := 10;~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; {1016#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:31,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1016#(<= (+ main_~i~0 9) main_~j~0)} assume true; {1016#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:31,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {1016#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1016#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:31,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {1016#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1016#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:31,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {1016#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1017#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2018-11-14 19:17:31,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {1017#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1018#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:31,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {1018#(<= (+ main_~i~0 7) main_~j~0)} assume true; {1018#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:31,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {1018#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1018#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:31,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {1018#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1018#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:31,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {1018#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1019#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2018-11-14 19:17:31,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {1019#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1020#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:31,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {1020#(<= (+ main_~i~0 5) main_~j~0)} assume true; {1020#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:31,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {1020#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1020#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:31,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {1020#(<= (+ main_~i~0 5) main_~j~0)} assume !(~i~0 < ~j~0); {1015#false} is VALID [2018-11-14 19:17:31,727 INFO L273 TraceCheckUtils]: 18: Hoare triple {1015#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1015#false} is VALID [2018-11-14 19:17:31,728 INFO L273 TraceCheckUtils]: 19: Hoare triple {1015#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1015#false} is VALID [2018-11-14 19:17:31,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {1015#false} assume true; {1015#false} is VALID [2018-11-14 19:17:31,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {1015#false} assume !(~i~0 <= ~n~0); {1015#false} is VALID [2018-11-14 19:17:31,729 INFO L256 TraceCheckUtils]: 22: Hoare triple {1015#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {1015#false} is VALID [2018-11-14 19:17:31,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {1015#false} ~cond := #in~cond; {1015#false} is VALID [2018-11-14 19:17:31,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {1015#false} assume ~cond == 0; {1015#false} is VALID [2018-11-14 19:17:31,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {1015#false} assume !false; {1015#false} is VALID [2018-11-14 19:17:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:31,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:17:31,747 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-14 19:17:31,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:17:31,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:17:31,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:17:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:31,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:32,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {1014#true} call ULTIMATE.init(); {1014#true} is VALID [2018-11-14 19:17:32,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {1014#true} assume true; {1014#true} is VALID [2018-11-14 19:17:32,401 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1014#true} {1014#true} #40#return; {1014#true} is VALID [2018-11-14 19:17:32,401 INFO L256 TraceCheckUtils]: 3: Hoare triple {1014#true} call #t~ret3 := main(); {1014#true} is VALID [2018-11-14 19:17:32,402 INFO L273 TraceCheckUtils]: 4: Hoare triple {1014#true} havoc ~i~0;~j~0 := 10;~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; {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:32,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume true; {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:32,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~i~0 <= ~n~0); {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:32,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:32,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {1036#(and (<= main_~i~0 1) (<= 10 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1049#(and (<= main_~i~0 1) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:32,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {1049#(and (<= main_~i~0 1) (<= 9 main_~j~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:32,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume true; {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:32,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume !!(~i~0 <= ~n~0); {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:32,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:32,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {1053#(and (<= main_~i~0 2) (<= 9 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1066#(and (<= 8 main_~j~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:17:32,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {1066#(and (<= 8 main_~j~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1070#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:32,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {1070#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume true; {1070#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:32,412 INFO L273 TraceCheckUtils]: 16: Hoare triple {1070#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1070#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:32,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {1070#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !(~i~0 < ~j~0); {1015#false} is VALID [2018-11-14 19:17:32,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {1015#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1015#false} is VALID [2018-11-14 19:17:32,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {1015#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1015#false} is VALID [2018-11-14 19:17:32,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {1015#false} assume true; {1015#false} is VALID [2018-11-14 19:17:32,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {1015#false} assume !(~i~0 <= ~n~0); {1015#false} is VALID [2018-11-14 19:17:32,416 INFO L256 TraceCheckUtils]: 22: Hoare triple {1015#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {1015#false} is VALID [2018-11-14 19:17:32,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {1015#false} ~cond := #in~cond; {1015#false} is VALID [2018-11-14 19:17:32,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {1015#false} assume ~cond == 0; {1015#false} is VALID [2018-11-14 19:17:32,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {1015#false} assume !false; {1015#false} is VALID [2018-11-14 19:17:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:32,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:17:32,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 19:17:32,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-14 19:17:32,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:32,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 19:17:32,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:32,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 19:17:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 19:17:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:17:32,540 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-14 19:17:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:32,760 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 19:17:32,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:17:32,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-14 19:17:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:17:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 19:17:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:17:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2018-11-14 19:17:32,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2018-11-14 19:17:32,869 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-14 19:17:32,871 INFO L225 Difference]: With dead ends: 44 [2018-11-14 19:17:32,871 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 19:17:32,872 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:17:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 19:17:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 19:17:32,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:32,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 19:17:32,947 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 19:17:32,947 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 19:17:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:32,949 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 19:17:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 19:17:32,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:32,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:32,950 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 19:17:32,950 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 19:17:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:32,952 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 19:17:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 19:17:32,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:32,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:32,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:32,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 19:17:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-14 19:17:32,954 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-11-14 19:17:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:32,955 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-14 19:17:32,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 19:17:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-14 19:17:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 19:17:32,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:32,956 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:32,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:32,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 162653665, now seen corresponding path program 3 times [2018-11-14 19:17:32,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:32,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:17:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:33,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {1273#true} call ULTIMATE.init(); {1273#true} is VALID [2018-11-14 19:17:33,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {1273#true} assume true; {1273#true} is VALID [2018-11-14 19:17:33,163 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1273#true} {1273#true} #40#return; {1273#true} is VALID [2018-11-14 19:17:33,164 INFO L256 TraceCheckUtils]: 3: Hoare triple {1273#true} call #t~ret3 := main(); {1273#true} is VALID [2018-11-14 19:17:33,172 INFO L273 TraceCheckUtils]: 4: Hoare triple {1273#true} havoc ~i~0;~j~0 := 10;~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; {1275#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:33,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {1275#(<= (+ main_~i~0 9) main_~j~0)} assume true; {1275#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:33,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {1275#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1275#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:33,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {1275#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1275#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:33,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {1275#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1276#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2018-11-14 19:17:33,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {1276#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:33,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {1277#(<= (+ main_~i~0 7) main_~j~0)} assume true; {1277#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:33,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {1277#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1277#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:33,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {1277#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1277#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:33,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {1277#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1278#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2018-11-14 19:17:33,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {1278#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1279#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:33,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {1279#(<= (+ main_~i~0 5) main_~j~0)} assume true; {1279#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:33,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {1279#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1279#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:33,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {1279#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1279#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:33,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {1279#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1280#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2018-11-14 19:17:33,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {1280#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1281#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:33,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {1281#(<= (+ main_~i~0 3) main_~j~0)} assume true; {1281#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:33,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {1281#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1281#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:33,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {1281#(<= (+ main_~i~0 3) main_~j~0)} assume !(~i~0 < ~j~0); {1274#false} is VALID [2018-11-14 19:17:33,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {1274#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1274#false} is VALID [2018-11-14 19:17:33,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {1274#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1274#false} is VALID [2018-11-14 19:17:33,185 INFO L273 TraceCheckUtils]: 25: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 19:17:33,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {1274#false} assume !(~i~0 <= ~n~0); {1274#false} is VALID [2018-11-14 19:17:33,186 INFO L256 TraceCheckUtils]: 27: Hoare triple {1274#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {1274#false} is VALID [2018-11-14 19:17:33,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {1274#false} ~cond := #in~cond; {1274#false} is VALID [2018-11-14 19:17:33,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {1274#false} assume ~cond == 0; {1274#false} is VALID [2018-11-14 19:17:33,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {1274#false} assume !false; {1274#false} is VALID [2018-11-14 19:17:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:33,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:17:33,189 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-14 19:17:33,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:17:33,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 19:17:33,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:17:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:33,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:33,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {1273#true} call ULTIMATE.init(); {1273#true} is VALID [2018-11-14 19:17:33,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {1273#true} assume true; {1273#true} is VALID [2018-11-14 19:17:33,523 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1273#true} {1273#true} #40#return; {1273#true} is VALID [2018-11-14 19:17:33,523 INFO L256 TraceCheckUtils]: 3: Hoare triple {1273#true} call #t~ret3 := main(); {1273#true} is VALID [2018-11-14 19:17:33,525 INFO L273 TraceCheckUtils]: 4: Hoare triple {1273#true} havoc ~i~0;~j~0 := 10;~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; {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:33,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume true; {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:33,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~i~0 <= ~n~0); {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:33,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:33,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {1297#(and (<= main_~i~0 1) (<= 10 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1310#(and (<= main_~i~0 1) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:33,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {1310#(and (<= main_~i~0 1) (<= 9 main_~j~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:33,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume true; {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:33,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume !!(~i~0 <= ~n~0); {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:33,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:33,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {1314#(and (<= main_~i~0 2) (<= 9 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1327#(and (<= 8 main_~j~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:17:33,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {1327#(and (<= 8 main_~j~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:33,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume true; {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:33,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:33,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:33,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {1331#(and (<= main_~i~0 3) (<= 8 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1344#(and (<= main_~i~0 3) (<= 7 main_~j~0))} is VALID [2018-11-14 19:17:33,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {1344#(and (<= main_~i~0 3) (<= 7 main_~j~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1348#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:33,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {1348#(and (<= 7 main_~j~0) (<= main_~i~0 4))} assume true; {1348#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:33,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {1348#(and (<= 7 main_~j~0) (<= main_~i~0 4))} assume !!(~i~0 <= ~n~0); {1348#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:33,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {1348#(and (<= 7 main_~j~0) (<= main_~i~0 4))} assume !(~i~0 < ~j~0); {1274#false} is VALID [2018-11-14 19:17:33,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {1274#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1274#false} is VALID [2018-11-14 19:17:33,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {1274#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1274#false} is VALID [2018-11-14 19:17:33,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {1274#false} assume true; {1274#false} is VALID [2018-11-14 19:17:33,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {1274#false} assume !(~i~0 <= ~n~0); {1274#false} is VALID [2018-11-14 19:17:33,539 INFO L256 TraceCheckUtils]: 27: Hoare triple {1274#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {1274#false} is VALID [2018-11-14 19:17:33,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {1274#false} ~cond := #in~cond; {1274#false} is VALID [2018-11-14 19:17:33,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {1274#false} assume ~cond == 0; {1274#false} is VALID [2018-11-14 19:17:33,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {1274#false} assume !false; {1274#false} is VALID [2018-11-14 19:17:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:33,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:17:33,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 19:17:33,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-14 19:17:33,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:33,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 19:17:33,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:33,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 19:17:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 19:17:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:17:33,621 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 16 states. [2018-11-14 19:17:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:33,883 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 19:17:33,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:17:33,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-14 19:17:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:17:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-14 19:17:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:17:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2018-11-14 19:17:33,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2018-11-14 19:17:33,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:33,951 INFO L225 Difference]: With dead ends: 49 [2018-11-14 19:17:33,952 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:17:33,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:17:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:17:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 19:17:33,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:33,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 19:17:33,981 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 19:17:33,982 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 19:17:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:33,984 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 19:17:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 19:17:33,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:33,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:33,985 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 19:17:33,985 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 19:17:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:33,987 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 19:17:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 19:17:33,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:33,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:33,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:33,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 19:17:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 19:17:33,990 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-11-14 19:17:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:33,990 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 19:17:33,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 19:17:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 19:17:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 19:17:33,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:33,991 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:33,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:33,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash 129265244, now seen corresponding path program 4 times [2018-11-14 19:17:33,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:33,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:33,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:33,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:17:33,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:34,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {1573#true} call ULTIMATE.init(); {1573#true} is VALID [2018-11-14 19:17:34,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {1573#true} assume true; {1573#true} is VALID [2018-11-14 19:17:34,194 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1573#true} {1573#true} #40#return; {1573#true} is VALID [2018-11-14 19:17:34,194 INFO L256 TraceCheckUtils]: 3: Hoare triple {1573#true} call #t~ret3 := main(); {1573#true} is VALID [2018-11-14 19:17:34,195 INFO L273 TraceCheckUtils]: 4: Hoare triple {1573#true} havoc ~i~0;~j~0 := 10;~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; {1575#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:34,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {1575#(<= (+ main_~i~0 9) main_~j~0)} assume true; {1575#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:34,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {1575#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1575#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:34,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {1575#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1575#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2018-11-14 19:17:34,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {1575#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1576#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2018-11-14 19:17:34,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {1576#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1577#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:34,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1577#(<= (+ main_~i~0 7) main_~j~0)} assume true; {1577#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:34,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {1577#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1577#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:34,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {1577#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1577#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2018-11-14 19:17:34,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1577#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1578#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2018-11-14 19:17:34,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {1578#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1579#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:34,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {1579#(<= (+ main_~i~0 5) main_~j~0)} assume true; {1579#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:34,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {1579#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1579#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:34,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {1579#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1579#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2018-11-14 19:17:34,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {1579#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1580#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2018-11-14 19:17:34,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {1580#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1581#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:34,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {1581#(<= (+ main_~i~0 3) main_~j~0)} assume true; {1581#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:34,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {1581#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1581#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:34,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {1581#(<= (+ main_~i~0 3) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1581#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2018-11-14 19:17:34,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {1581#(<= (+ main_~i~0 3) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1582#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2018-11-14 19:17:34,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {1582#(<= (+ main_~i~0 2) main_~j~0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1583#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2018-11-14 19:17:34,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {1583#(<= (+ main_~i~0 1) main_~j~0)} assume true; {1583#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2018-11-14 19:17:34,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {1583#(<= (+ main_~i~0 1) main_~j~0)} assume !!(~i~0 <= ~n~0); {1583#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2018-11-14 19:17:34,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {1583#(<= (+ main_~i~0 1) main_~j~0)} assume !(~i~0 < ~j~0); {1574#false} is VALID [2018-11-14 19:17:34,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {1574#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1574#false} is VALID [2018-11-14 19:17:34,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {1574#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1574#false} is VALID [2018-11-14 19:17:34,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {1574#false} assume true; {1574#false} is VALID [2018-11-14 19:17:34,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {1574#false} assume !(~i~0 <= ~n~0); {1574#false} is VALID [2018-11-14 19:17:34,216 INFO L256 TraceCheckUtils]: 32: Hoare triple {1574#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {1574#false} is VALID [2018-11-14 19:17:34,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {1574#false} ~cond := #in~cond; {1574#false} is VALID [2018-11-14 19:17:34,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {1574#false} assume ~cond == 0; {1574#false} is VALID [2018-11-14 19:17:34,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {1574#false} assume !false; {1574#false} is VALID [2018-11-14 19:17:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:34,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:17:34,218 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-14 19:17:34,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:17:34,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:17:34,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:17:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:34,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:34,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {1573#true} call ULTIMATE.init(); {1573#true} is VALID [2018-11-14 19:17:34,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {1573#true} assume true; {1573#true} is VALID [2018-11-14 19:17:34,515 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1573#true} {1573#true} #40#return; {1573#true} is VALID [2018-11-14 19:17:34,516 INFO L256 TraceCheckUtils]: 3: Hoare triple {1573#true} call #t~ret3 := main(); {1573#true} is VALID [2018-11-14 19:17:34,516 INFO L273 TraceCheckUtils]: 4: Hoare triple {1573#true} havoc ~i~0;~j~0 := 10;~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; {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:34,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume true; {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:34,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume !!(~i~0 <= ~n~0); {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:34,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} is VALID [2018-11-14 19:17:34,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {1599#(and (<= main_~i~0 1) (<= 10 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1612#(and (<= main_~i~0 1) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:34,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {1612#(and (<= main_~i~0 1) (<= 9 main_~j~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:34,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume true; {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:34,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume !!(~i~0 <= ~n~0); {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:34,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} is VALID [2018-11-14 19:17:34,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {1616#(and (<= main_~i~0 2) (<= 9 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1629#(and (<= 8 main_~j~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:17:34,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {1629#(and (<= 8 main_~j~0) (<= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:34,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume true; {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:34,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:34,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2018-11-14 19:17:34,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {1633#(and (<= main_~i~0 3) (<= 8 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1646#(and (<= main_~i~0 3) (<= 7 main_~j~0))} is VALID [2018-11-14 19:17:34,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {1646#(and (<= main_~i~0 3) (<= 7 main_~j~0))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:34,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} assume true; {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:34,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} assume !!(~i~0 <= ~n~0); {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:34,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} assume ~i~0 < ~j~0;~sn~0 := ~sn~0 + 2; {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:34,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {1650#(and (<= 7 main_~j~0) (<= main_~i~0 4))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1663#(and (<= 6 main_~j~0) (<= main_~i~0 4))} is VALID [2018-11-14 19:17:34,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {1663#(and (<= 6 main_~j~0) (<= main_~i~0 4))} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1667#(and (<= 6 main_~j~0) (<= main_~i~0 5))} is VALID [2018-11-14 19:17:34,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {1667#(and (<= 6 main_~j~0) (<= main_~i~0 5))} assume true; {1667#(and (<= 6 main_~j~0) (<= main_~i~0 5))} is VALID [2018-11-14 19:17:34,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {1667#(and (<= 6 main_~j~0) (<= main_~i~0 5))} assume !!(~i~0 <= ~n~0); {1667#(and (<= 6 main_~j~0) (<= main_~i~0 5))} is VALID [2018-11-14 19:17:34,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {1667#(and (<= 6 main_~j~0) (<= main_~i~0 5))} assume !(~i~0 < ~j~0); {1574#false} is VALID [2018-11-14 19:17:34,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {1574#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1574#false} is VALID [2018-11-14 19:17:34,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {1574#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1574#false} is VALID [2018-11-14 19:17:34,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {1574#false} assume true; {1574#false} is VALID [2018-11-14 19:17:34,537 INFO L273 TraceCheckUtils]: 31: Hoare triple {1574#false} assume !(~i~0 <= ~n~0); {1574#false} is VALID [2018-11-14 19:17:34,537 INFO L256 TraceCheckUtils]: 32: Hoare triple {1574#false} call __VERIFIER_assert((if ~sn~0 == ~n~0 * 2 || ~sn~0 == 0 then 1 else 0)); {1574#false} is VALID [2018-11-14 19:17:34,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {1574#false} ~cond := #in~cond; {1574#false} is VALID [2018-11-14 19:17:34,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {1574#false} assume ~cond == 0; {1574#false} is VALID [2018-11-14 19:17:34,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {1574#false} assume !false; {1574#false} is VALID [2018-11-14 19:17:34,541 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:34,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:17:34,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 19:17:34,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-14 19:17:34,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:34,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 19:17:34,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:34,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 19:17:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 19:17:34,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:17:34,631 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2018-11-14 19:17:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:34,942 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-14 19:17:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 19:17:34,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-11-14 19:17:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:17:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-14 19:17:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:17:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-14 19:17:34,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 53 transitions. [2018-11-14 19:17:35,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:35,007 INFO L225 Difference]: With dead ends: 55 [2018-11-14 19:17:35,007 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 19:17:35,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:17:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 19:17:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-14 19:17:35,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:35,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-14 19:17:35,065 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-14 19:17:35,065 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-14 19:17:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:35,067 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-14 19:17:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-14 19:17:35,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:35,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:35,068 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-14 19:17:35,068 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-14 19:17:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:35,070 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-14 19:17:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-14 19:17:35,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:35,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:35,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:35,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 19:17:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-14 19:17:35,073 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2018-11-14 19:17:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:35,074 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-14 19:17:35,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 19:17:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-14 19:17:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 19:17:35,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:35,075 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:35,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:35,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1609235137, now seen corresponding path program 5 times [2018-11-14 19:17:35,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:35,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:17:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:17:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:17:35,193 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 19:17:35,231 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:17:35,232 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:17:35,233 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:17:35,234 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-14 19:17:35,234 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-14 19:17:35,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:17:35 BoogieIcfgContainer [2018-11-14 19:17:35,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:17:35,239 INFO L168 Benchmark]: Toolchain (without parser) took 12920.89 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 872.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -536.1 MB). Peak memory consumption was 336.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:35,240 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:17:35,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.36 ms. Allocated memory is still 1.6 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-14 19:17:35,241 INFO L168 Benchmark]: Boogie Preprocessor took 41.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:17:35,241 INFO L168 Benchmark]: RCFGBuilder took 596.09 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:35,242 INFO L168 Benchmark]: TraceAbstraction took 11914.65 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 113.8 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 259.6 MB). Peak memory consumption was 373.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:35,246 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.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 361.36 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 596.09 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 758.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11914.65 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 113.8 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 259.6 MB). Peak memory consumption was 373.4 MB. 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, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i