java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:25:55,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:25:55,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:25:55,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:25:55,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:25:55,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:25:55,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:25:55,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:25:55,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:25:55,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:25:55,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:25:55,601 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:25:55,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:25:55,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:25:55,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:25:55,605 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:25:55,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:25:55,608 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:25:55,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:25:55,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:25:55,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:25:55,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:25:55,617 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:25:55,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:25:55,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:25:55,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:25:55,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:25:55,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:25:55,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:25:55,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:25:55,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:25:55,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:25:55,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:25:55,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:25:55,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:25:55,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:25:55,627 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:25:55,652 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:25:55,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:25:55,653 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:25:55,653 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:25:55,655 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:25:55,655 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:25:55,655 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:25:55,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:25:55,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:25:55,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:25:55,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:25:55,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:25:55,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:25:55,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:25:55,658 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:25:55,658 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:25:55,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:25:55,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:25:55,659 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:25:55,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:25:55,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:25:55,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:25:55,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:25:55,660 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:25:55,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:55,661 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:25:55,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:25:55,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:25:55,662 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:25:55,662 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:25:55,662 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:25:55,662 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:25:55,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:25:55,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:25:55,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:25:55,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:25:55,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:25:55,731 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:25:55,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i [2018-11-23 11:25:55,800 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86db3ef76/f37cfc1dc0e0426da7ab2aaec85c7e88/FLAG900a8447d [2018-11-23 11:25:56,297 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:25:56,298 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_true-unreach-call_true-termination.i [2018-11-23 11:25:56,304 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86db3ef76/f37cfc1dc0e0426da7ab2aaec85c7e88/FLAG900a8447d [2018-11-23 11:25:56,671 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86db3ef76/f37cfc1dc0e0426da7ab2aaec85c7e88 [2018-11-23 11:25:56,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:25:56,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:25:56,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:56,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:25:56,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:25:56,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:56,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585a350b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56, skipping insertion in model container [2018-11-23 11:25:56,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:56,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:25:56,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:25:56,941 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:56,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:25:56,966 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:56,983 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:25:56,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56 WrapperNode [2018-11-23 11:25:56,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:56,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:56,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:25:56,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:25:56,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:57,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:25:57,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:25:57,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:25:57,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... [2018-11-23 11:25:57,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:25:57,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:25:57,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:25:57,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:25:57,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:25:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:25:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:25:57,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:25:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:25:57,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:25:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:25:57,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:25:57,554 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:25:57,554 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:25:57,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:57 BoogieIcfgContainer [2018-11-23 11:25:57,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:25:57,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:25:57,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:25:57,559 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:25:57,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:56" (1/3) ... [2018-11-23 11:25:57,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51451b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:57, skipping insertion in model container [2018-11-23 11:25:57,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:56" (2/3) ... [2018-11-23 11:25:57,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51451b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:57, skipping insertion in model container [2018-11-23 11:25:57,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:57" (3/3) ... [2018-11-23 11:25:57,563 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_true-unreach-call_true-termination.i [2018-11-23 11:25:57,575 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:25:57,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:25:57,606 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:25:57,637 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:25:57,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:25:57,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:25:57,638 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:25:57,638 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:25:57,638 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:25:57,638 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:25:57,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:25:57,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:25:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 11:25:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:25:57,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:57,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:57,679 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:57,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-23 11:25:57,688 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:57,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:57,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:57,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 11:25:57,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 11:25:57,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-23 11:25:57,846 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 11:25:57,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {21#true} is VALID [2018-11-23 11:25:57,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 11:25:57,849 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {22#false} is VALID [2018-11-23 11:25:57,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 11:25:57,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-23 11:25:57,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 11:25:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:57,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:57,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:57,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:25:57,863 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:25:57,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:57,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:25:57,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:57,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:25:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:25:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:57,957 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 11:25:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,037 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 11:25:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:25:58,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:25:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-23 11:25:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-23 11:25:58,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-23 11:25:58,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:58,295 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:25:58,295 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:25:58,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:25:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:25:58,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:58,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:25:58,412 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:25:58,412 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:25:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,415 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:25:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:25:58,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:58,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:58,416 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:25:58,417 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:25:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,420 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:25:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:25:58,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:58,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:58,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:58,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:25:58,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:25:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:58,426 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:25:58,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:25:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:25:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:25:58,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:58,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:58,427 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:58,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2018-11-23 11:25:58,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:58,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:58,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:58,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {133#true} call ULTIMATE.init(); {133#true} is VALID [2018-11-23 11:25:58,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {133#true} assume true; {133#true} is VALID [2018-11-23 11:25:58,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {133#true} {133#true} #32#return; {133#true} is VALID [2018-11-23 11:25:58,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {133#true} call #t~ret1 := main(); {133#true} is VALID [2018-11-23 11:25:58,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {133#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {150#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:25:58,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(= (_ bv0 32) main_~sn~0)} assume !~bvsle32(~i~0, 8bv32); {150#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:25:58,658 INFO L256 TraceCheckUtils]: 6: Hoare triple {150#(= (_ bv0 32) main_~sn~0)} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {157#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:58,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {157#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {161#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:58,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {161#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {134#false} is VALID [2018-11-23 11:25:58,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {134#false} assume !false; {134#false} is VALID [2018-11-23 11:25:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:58,664 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:58,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:25:58,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:25:58,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:58,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:25:58,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:58,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:25:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:25:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:25:58,712 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 11:25:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,947 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:25:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:25:58,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:25:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 11:25:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-23 11:25:58,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2018-11-23 11:25:59,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:59,008 INFO L225 Difference]: With dead ends: 18 [2018-11-23 11:25:59,008 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:25:59,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:25:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:25:59,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:59,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:59,021 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:59,021 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:59,023 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:25:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:25:59,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:59,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:59,023 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:59,024 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:25:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:59,025 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:25:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:25:59,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:59,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:59,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:59,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:25:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 11:25:59,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-23 11:25:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:59,028 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 11:25:59,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:25:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:25:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:25:59,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:59,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:59,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:59,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2018-11-23 11:25:59,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:59,030 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:25:59,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:59,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:59,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2018-11-23 11:25:59,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2018-11-23 11:25:59,134 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} #32#return; {244#true} is VALID [2018-11-23 11:25:59,134 INFO L256 TraceCheckUtils]: 3: Hoare triple {244#true} call #t~ret1 := main(); {244#true} is VALID [2018-11-23 11:25:59,135 INFO L273 TraceCheckUtils]: 4: Hoare triple {244#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {261#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:59,136 INFO L273 TraceCheckUtils]: 5: Hoare triple {261#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {261#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:59,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {261#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {268#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:25:59,140 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#(= (_ bv2 32) main_~i~0)} assume !~bvsle32(~i~0, 8bv32); {245#false} is VALID [2018-11-23 11:25:59,140 INFO L256 TraceCheckUtils]: 8: Hoare triple {245#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {245#false} is VALID [2018-11-23 11:25:59,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {245#false} ~cond := #in~cond; {245#false} is VALID [2018-11-23 11:25:59,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {245#false} assume 0bv32 == ~cond; {245#false} is VALID [2018-11-23 11:25:59,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {245#false} assume !false; {245#false} is VALID [2018-11-23 11:25:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:59,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:59,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {245#false} assume !false; {245#false} is VALID [2018-11-23 11:25:59,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {245#false} assume 0bv32 == ~cond; {245#false} is VALID [2018-11-23 11:25:59,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {245#false} ~cond := #in~cond; {245#false} is VALID [2018-11-23 11:25:59,635 INFO L256 TraceCheckUtils]: 8: Hoare triple {245#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {245#false} is VALID [2018-11-23 11:25:59,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {296#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {245#false} is VALID [2018-11-23 11:25:59,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {300#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {296#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-23 11:25:59,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {300#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {300#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:25:59,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {244#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {300#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:25:59,638 INFO L256 TraceCheckUtils]: 3: Hoare triple {244#true} call #t~ret1 := main(); {244#true} is VALID [2018-11-23 11:25:59,639 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} #32#return; {244#true} is VALID [2018-11-23 11:25:59,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2018-11-23 11:25:59,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2018-11-23 11:25:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:59,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:25:59,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:25:59,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:59,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:25:59,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:59,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:25:59,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:25:59,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:25:59,675 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 11:26:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:00,016 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:26:00,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:26:00,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:26:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-23 11:26:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-23 11:26:00,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2018-11-23 11:26:00,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:00,070 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:26:00,070 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:26:00,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:26:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:26:00,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:00,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:26:00,115 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:26:00,115 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:26:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:00,118 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 11:26:00,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:26:00,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:00,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:00,119 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:26:00,119 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:26:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:00,121 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 11:26:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:26:00,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:00,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:00,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:00,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:26:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 11:26:00,125 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2018-11-23 11:26:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:00,125 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 11:26:00,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:26:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:26:00,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:00,126 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:00,127 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:00,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:00,127 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 2 times [2018-11-23 11:26:00,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:00,128 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:00,150 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:00,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:00,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:00,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:00,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2018-11-23 11:26:00,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2018-11-23 11:26:00,331 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #32#return; {428#true} is VALID [2018-11-23 11:26:00,331 INFO L256 TraceCheckUtils]: 3: Hoare triple {428#true} call #t~ret1 := main(); {428#true} is VALID [2018-11-23 11:26:00,332 INFO L273 TraceCheckUtils]: 4: Hoare triple {428#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:00,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:00,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {452#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:00,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {452#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {452#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:00,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {452#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {459#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:00,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {459#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {459#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:00,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {459#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {466#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:00,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {466#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {466#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:00,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {473#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:00,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {473#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsle32(~i~0, 8bv32); {429#false} is VALID [2018-11-23 11:26:00,353 INFO L256 TraceCheckUtils]: 14: Hoare triple {429#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {429#false} is VALID [2018-11-23 11:26:00,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2018-11-23 11:26:00,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {429#false} assume 0bv32 == ~cond; {429#false} is VALID [2018-11-23 11:26:00,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {429#false} assume !false; {429#false} is VALID [2018-11-23 11:26:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:00,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:00,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {429#false} assume !false; {429#false} is VALID [2018-11-23 11:26:00,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {429#false} assume 0bv32 == ~cond; {429#false} is VALID [2018-11-23 11:26:00,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2018-11-23 11:26:00,601 INFO L256 TraceCheckUtils]: 14: Hoare triple {429#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {429#false} is VALID [2018-11-23 11:26:00,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {501#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {429#false} is VALID [2018-11-23 11:26:00,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {505#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {501#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-23 11:26:00,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {505#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {505#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {505#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {512#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {519#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {512#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {519#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {526#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {519#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {526#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {526#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,616 INFO L273 TraceCheckUtils]: 4: Hoare triple {428#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {526#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-23 11:26:00,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {428#true} call #t~ret1 := main(); {428#true} is VALID [2018-11-23 11:26:00,616 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #32#return; {428#true} is VALID [2018-11-23 11:26:00,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2018-11-23 11:26:00,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2018-11-23 11:26:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:00,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:00,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:26:00,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:26:00,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:00,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:26:00,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:00,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:26:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:26:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:00,759 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-23 11:26:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:01,364 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 11:26:01,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:26:01,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:26:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 11:26:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 11:26:01,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2018-11-23 11:26:01,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:01,458 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:26:01,458 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:26:01,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:26:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:26:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:26:01,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:01,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:26:01,497 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:26:01,498 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:26:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:01,500 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 11:26:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:26:01,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:01,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:01,501 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:26:01,501 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:26:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:01,503 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 11:26:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:26:01,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:01,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:01,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:01,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:26:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 11:26:01,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 18 [2018-11-23 11:26:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:01,507 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 11:26:01,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:26:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:26:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:26:01,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:01,509 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:01,509 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:01,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:01,509 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 3 times [2018-11-23 11:26:01,510 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:01,510 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:01,530 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:26:01,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:26:01,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:01,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:01,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-23 11:26:01,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-23 11:26:01,962 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {696#true} {696#true} #32#return; {696#true} is VALID [2018-11-23 11:26:01,963 INFO L256 TraceCheckUtils]: 3: Hoare triple {696#true} call #t~ret1 := main(); {696#true} is VALID [2018-11-23 11:26:01,964 INFO L273 TraceCheckUtils]: 4: Hoare triple {696#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {713#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {713#(= (_ bv0 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {717#(= (_ bv2 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {717#(= (_ bv2 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {717#(= (_ bv2 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {717#(= (_ bv2 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {724#(= (_ bv4 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {724#(= (_ bv4 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {724#(= (_ bv4 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {724#(= (_ bv4 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {731#(= (_ bv6 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {731#(= (_ bv6 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {731#(= (_ bv6 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {731#(= (_ bv6 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {738#(= (_ bv8 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {738#(= (_ bv8 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {738#(= (_ bv8 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,979 INFO L273 TraceCheckUtils]: 13: Hoare triple {738#(= (_ bv8 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {745#(= (_ bv10 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {745#(= (_ bv10 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {745#(= (_ bv10 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {745#(= (_ bv10 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {752#(= (_ bv12 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {752#(= (_ bv12 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {752#(= (_ bv12 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {752#(= (_ bv12 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {759#(= (_ bv14 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {759#(= (_ bv14 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {759#(= (_ bv14 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {759#(= (_ bv14 32) main_~sn~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {766#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,985 INFO L273 TraceCheckUtils]: 20: Hoare triple {766#(= (_ bv16 32) main_~sn~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {766#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,986 INFO L273 TraceCheckUtils]: 21: Hoare triple {766#(= (_ bv16 32) main_~sn~0)} assume !~bvsle32(~i~0, 8bv32); {766#(= (_ bv16 32) main_~sn~0)} is VALID [2018-11-23 11:26:01,987 INFO L256 TraceCheckUtils]: 22: Hoare triple {766#(= (_ bv16 32) main_~sn~0)} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {776#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:01,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {776#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {780#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:01,989 INFO L273 TraceCheckUtils]: 24: Hoare triple {780#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {697#false} is VALID [2018-11-23 11:26:01,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-23 11:26:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:01,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:02,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-23 11:26:02,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {790#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {697#false} is VALID [2018-11-23 11:26:02,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {794#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {790#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:26:02,511 INFO L256 TraceCheckUtils]: 22: Hoare triple {798#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {794#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {798#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} assume !~bvsle32(~i~0, 8bv32); {798#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {798#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {798#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {808#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {798#(or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {808#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {808#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {815#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {808#(or (= (_ bv4294967294 32) main_~sn~0) (= (_ bv14 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {815#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {815#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {822#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {815#(or (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (= (_ bv12 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {822#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {822#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {829#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {822#(or (= (_ bv10 32) main_~sn~0) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {829#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {829#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {836#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {829#(or (= (_ bv8 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv8 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {836#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {836#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {836#(or (= (_ bv6 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {843#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {843#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {850#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {843#(or (= (bvadd main_~sn~0 (_ bv12 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {850#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {850#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {857#(or (= (_ bv0 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv16 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {850#(or (= (bvadd main_~sn~0 (_ bv14 32)) (_ bv0 32)) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-23 11:26:02,558 INFO L273 TraceCheckUtils]: 4: Hoare triple {696#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {857#(or (= (_ bv0 32) main_~sn~0) (= (bvadd main_~sn~0 (_ bv16 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {696#true} call #t~ret1 := main(); {696#true} is VALID [2018-11-23 11:26:02,559 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {696#true} {696#true} #32#return; {696#true} is VALID [2018-11-23 11:26:02,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-23 11:26:02,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-23 11:26:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:02,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:02,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:26:02,575 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-11-23 11:26:02,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:02,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:26:02,681 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-23 11:26:02,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:26:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:26:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:26:02,683 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2018-11-23 11:26:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:03,780 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 11:26:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:26:03,781 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-11-23 11:26:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2018-11-23 11:26:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2018-11-23 11:26:03,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2018-11-23 11:26:03,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:03,845 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:26:03,845 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:26:03,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:26:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:26:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 11:26:03,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:03,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 11:26:03,869 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:26:03,870 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:26:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:03,873 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 11:26:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 11:26:03,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:03,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:03,874 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:26:03,874 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:26:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:03,877 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 11:26:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 11:26:03,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:03,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:03,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:03,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:26:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 11:26:03,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 11:26:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:03,881 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 11:26:03,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:26:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 11:26:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:26:03,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:03,882 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:03,883 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:03,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 4 times [2018-11-23 11:26:03,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:03,884 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:26:03,904 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:26:03,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:26:03,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:03,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:04,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2018-11-23 11:26:04,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-23 11:26:04,165 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1032#true} {1032#true} #32#return; {1032#true} is VALID [2018-11-23 11:26:04,165 INFO L256 TraceCheckUtils]: 3: Hoare triple {1032#true} call #t~ret1 := main(); {1032#true} is VALID [2018-11-23 11:26:04,166 INFO L273 TraceCheckUtils]: 4: Hoare triple {1032#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {1049#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {1049#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1049#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {1049#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1056#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:04,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {1056#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1056#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:04,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {1056#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1070#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:04,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {1070#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1070#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:04,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {1070#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1077#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {1077#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1077#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {1077#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1084#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:04,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(= (_ bv6 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1084#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:04,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1091#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {1091#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1091#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {1091#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1098#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:04,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#(= (_ bv8 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1098#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:04,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {1098#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1105#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:04,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {1105#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1033#false} is VALID [2018-11-23 11:26:04,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {1033#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1033#false} is VALID [2018-11-23 11:26:04,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {1033#false} assume !~bvsle32(~i~0, 8bv32); {1033#false} is VALID [2018-11-23 11:26:04,180 INFO L256 TraceCheckUtils]: 24: Hoare triple {1033#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1033#false} is VALID [2018-11-23 11:26:04,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {1033#false} ~cond := #in~cond; {1033#false} is VALID [2018-11-23 11:26:04,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {1033#false} assume 0bv32 == ~cond; {1033#false} is VALID [2018-11-23 11:26:04,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2018-11-23 11:26:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:04,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:04,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2018-11-23 11:26:04,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {1033#false} assume 0bv32 == ~cond; {1033#false} is VALID [2018-11-23 11:26:04,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {1033#false} ~cond := #in~cond; {1033#false} is VALID [2018-11-23 11:26:04,612 INFO L256 TraceCheckUtils]: 24: Hoare triple {1033#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1033#false} is VALID [2018-11-23 11:26:04,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {1033#false} assume !~bvsle32(~i~0, 8bv32); {1033#false} is VALID [2018-11-23 11:26:04,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {1033#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1033#false} is VALID [2018-11-23 11:26:04,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {1145#(not (bvsle main_~i~0 (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1033#false} is VALID [2018-11-23 11:26:04,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {1149#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#(not (bvsle main_~i~0 (_ bv8 32)))} is VALID [2018-11-23 11:26:04,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1149#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1149#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {1156#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1149#(not (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {1156#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1156#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1156#(not (bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {1163#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1163#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {1170#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1163#(not (bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {1170#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1170#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {1177#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1170#(not (bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {1177#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1177#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {1184#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1177#(not (bvsle (bvadd main_~i~0 (_ bv5 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {1184#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1184#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {1191#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1184#(not (bvsle (bvadd main_~i~0 (_ bv6 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {1191#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1191#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {1198#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1191#(not (bvsle (bvadd main_~i~0 (_ bv7 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} assume !!~bvsle32(~i~0, 8bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1198#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,647 INFO L273 TraceCheckUtils]: 4: Hoare triple {1032#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {1198#(not (bvsle (bvadd main_~i~0 (_ bv8 32)) (_ bv8 32)))} is VALID [2018-11-23 11:26:04,647 INFO L256 TraceCheckUtils]: 3: Hoare triple {1032#true} call #t~ret1 := main(); {1032#true} is VALID [2018-11-23 11:26:04,647 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1032#true} {1032#true} #32#return; {1032#true} is VALID [2018-11-23 11:26:04,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {1032#true} assume true; {1032#true} is VALID [2018-11-23 11:26:04,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {1032#true} call ULTIMATE.init(); {1032#true} is VALID [2018-11-23 11:26:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:04,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:04,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 11:26:04,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-23 11:26:04,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:04,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:26:04,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:04,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:26:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:26:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:26:04,744 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 20 states. [2018-11-23 11:26:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:05,633 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 11:26:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:26:05,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-11-23 11:26:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:26:05,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-11-23 11:26:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:26:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2018-11-23 11:26:05,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 29 transitions. [2018-11-23 11:26:05,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:05,689 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:26:05,689 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:26:05,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:26:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:26:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:26:05,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:05,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:05,692 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:05,692 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:05,692 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:05,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:05,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:05,693 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:05,693 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:26:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:05,694 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:26:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:05,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:05,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:05,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:05,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:26:05,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:26:05,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-23 11:26:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:05,695 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:26:05,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:26:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:26:05,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:05,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:26:06,131 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-23 11:26:06,164 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:26:06,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:06,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:26:06,164 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:26:06,164 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:26:06,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:26:06,165 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2018-11-23 11:26:06,165 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2018-11-23 11:26:06,165 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2018-11-23 11:26:06,165 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2018-11-23 11:26:06,166 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (= (_ bv14 32) main_~sn~0) (= (_ bv8 32) main_~i~0)) (and (= (_ bv6 32) main_~i~0) (= (_ bv10 32) main_~sn~0)) (and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv8 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (_ bv16 32) main_~sn~0)) (and (= (_ bv12 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0)) (and (= (_ bv6 32) main_~sn~0) (= (_ bv4 32) main_~i~0)) (and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))) [2018-11-23 11:26:06,166 INFO L444 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (or (= (_ bv0 32) main_~sn~0) (= (_ bv16 32) main_~sn~0)) [2018-11-23 11:26:06,166 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:26:06,167 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:26:06,167 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:26:06,167 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:26:06,167 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:26:06,167 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:26:06,169 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:26:06,170 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:06,170 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:26:06,171 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:26:06,173 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:06,174 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:26:06,174 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:26:06,174 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:26:06,174 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:26:06,174 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:26:06,174 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:26:06,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:26:06 BoogieIcfgContainer [2018-11-23 11:26:06,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:26:06,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:26:06,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:26:06,189 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:26:06,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:57" (3/4) ... [2018-11-23 11:26:06,194 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:26:06,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:26:06,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:26:06,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:26:06,206 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:26:06,206 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 11:26:06,206 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:26:06,271 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:26:06,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:26:06,273 INFO L168 Benchmark]: Toolchain (without parser) took 9590.23 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 847.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.5 MB). Peak memory consumption was 595.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:06,275 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:06,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:06,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:06,277 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:26:06,277 INFO L168 Benchmark]: RCFGBuilder took 512.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:06,279 INFO L168 Benchmark]: TraceAbstraction took 8632.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 624.3 MB). Peak memory consumption was 624.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:06,280 INFO L168 Benchmark]: Witness Printer took 82.47 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 152.0 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -797.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:26:06,284 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 300.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 512.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -745.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8632.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 624.3 MB). Peak memory consumption was 624.3 MB. Max. memory is 7.1 GB. * Witness Printer took 82.47 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 152.0 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -797.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((14bv32 == sn && 8bv32 == i) || (6bv32 == i && 10bv32 == sn)) || (0bv32 == sn && ~bvadd64(i, 4294967295bv32) == 0bv32)) || (8bv32 == sn && ~bvadd64(i, 4294967291bv32) == 0bv32)) || (~bvadd64(i, 4294967287bv32) == 0bv32 && 16bv32 == sn)) || (12bv32 == sn && ~bvadd64(i, 4294967289bv32) == 0bv32)) || (2bv32 == sn && 2bv32 == i)) || (6bv32 == sn && 4bv32 == i)) || (~bvadd64(i, 4294967293bv32) == 0bv32 && 4bv32 == sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 8.5s OverallTime, 6 OverallIterations, 9 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 16 SDslu, 407 SDs, 0 SdLazy, 456 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 86 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 13217 SizeOfPredicates, 7 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 34/324 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...