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/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:23:45,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:23:45,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:23:45,729 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:23:45,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:23:45,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:23:45,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:23:45,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:23:45,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:23:45,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:23:45,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:23:45,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:23:45,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:23:45,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:23:45,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:23:45,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:23:45,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:23:45,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:23:45,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:23:45,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:23:45,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:23:45,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:23:45,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:23:45,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:23:45,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:23:45,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:23:45,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:23:45,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:23:45,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:23:45,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:23:45,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:23:45,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:23:45,763 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:23:45,763 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:23:45,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:23:45,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:23:45,766 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:23:45,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:23:45,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:23:45,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:23:45,795 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:23:45,795 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:23:45,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:23:45,796 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:23:45,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:23:45,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:23:45,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:23:45,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:23:45,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:23:45,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:23:45,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:23:45,798 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:23:45,798 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:23:45,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:23:45,801 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:23:45,801 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:23:45,801 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:23:45,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:23:45,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:23:45,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:23:45,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:23:45,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:45,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:23:45,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:23:45,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:23:45,803 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:23:45,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:23:45,804 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:23:45,805 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:23:45,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:23:45,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:23:45,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:23:45,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:23:45,898 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:23:45,898 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:23:45,899 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 11:23:45,967 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586a52c28/d02271ca9f274d45879a1188a355b8b7/FLAG7aec36fb3 [2018-11-23 11:23:46,456 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:23:46,459 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 11:23:46,467 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586a52c28/d02271ca9f274d45879a1188a355b8b7/FLAG7aec36fb3 [2018-11-23 11:23:46,809 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586a52c28/d02271ca9f274d45879a1188a355b8b7 [2018-11-23 11:23:46,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:23:46,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:23:46,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:46,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:23:46,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:23:46,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:46" (1/1) ... [2018-11-23 11:23:46,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e407d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:46, skipping insertion in model container [2018-11-23 11:23:46,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:46" (1/1) ... [2018-11-23 11:23:46,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:23:46,865 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:23:47,091 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:47,098 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:23:47,122 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:47,143 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:23:47,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47 WrapperNode [2018-11-23 11:23:47,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:47,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:47,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:23:47,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:23:47,157 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:23:47" (1/1) ... [2018-11-23 11:23:47,165 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:23:47" (1/1) ... [2018-11-23 11:23:47,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:47,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:23:47,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:23:47,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:23:47,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... [2018-11-23 11:23:47,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:23:47,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:23:47,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:23:47,204 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:23:47,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:23:47,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:23:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:23:47,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:23:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:23:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:23:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:23:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:23:47,838 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:23:47,839 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:23:47,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:47 BoogieIcfgContainer [2018-11-23 11:23:47,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:23:47,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:23:47,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:23:47,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:23:47,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:23:46" (1/3) ... [2018-11-23 11:23:47,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e46f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:47, skipping insertion in model container [2018-11-23 11:23:47,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:47" (2/3) ... [2018-11-23 11:23:47,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e46f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:47, skipping insertion in model container [2018-11-23 11:23:47,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:47" (3/3) ... [2018-11-23 11:23:47,849 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 11:23:47,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:23:47,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:23:47,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:23:47,919 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:23:47,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:23:47,920 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:23:47,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:23:47,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:23:47,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:23:47,921 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:23:47,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:23:47,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:23:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:23:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:23:47,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:47,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:47,950 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:47,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 11:23:47,960 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:47,961 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:23:47,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:48,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:48,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:23:48,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:23:48,105 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2018-11-23 11:23:48,106 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 11:23:48,106 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {22#true} is VALID [2018-11-23 11:23:48,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 11:23:48,108 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-23 11:23:48,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 11:23:48,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:23:48,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:23:48,111 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:23:48,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:48,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:48,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:23:48,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:23:48,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:48,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:23:48,169 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:23:48,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:23:48,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:23:48,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:23:48,180 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 11:23:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:48,297 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:23:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:23:48,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:23:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 11:23:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 11:23:48,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 11:23:48,618 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:23:48,630 INFO L225 Difference]: With dead ends: 30 [2018-11-23 11:23:48,630 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:23:48,633 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:23:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:23:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:23:48,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:48,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:23:48,696 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:23:48,696 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:23:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:48,699 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:23:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:23:48,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:48,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:48,700 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:23:48,700 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:23:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:48,703 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:23:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:23:48,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:48,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:48,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:48,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:23:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 11:23:48,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 11:23:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:48,709 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 11:23:48,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:23:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:23:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:23:48,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:48,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:48,711 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:48,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:48,711 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 11:23:48,712 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:48,712 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:23:48,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:48,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:48,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-23 11:23:48,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-23 11:23:48,954 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #37#return; {138#true} is VALID [2018-11-23 11:23:48,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret2 := main(); {138#true} is VALID [2018-11-23 11:23:48,955 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:23:48,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} assume !~bvsle32(~i~0, ~n~0); {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:23:48,959 INFO L256 TraceCheckUtils]: 6: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {162#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:48,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {162#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {166#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:48,965 INFO L273 TraceCheckUtils]: 8: Hoare triple {166#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {139#false} is VALID [2018-11-23 11:23:48,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-23 11:23:48,967 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:23:48,967 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:48,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:48,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:23:48,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:23:48,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:48,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:23:49,005 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:23:49,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:23:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:23:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:23:49,006 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 11:23:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:49,257 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:23:49,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:23:49,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:23:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:23:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 11:23:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:23:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 11:23:49,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-11-23 11:23:49,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:49,310 INFO L225 Difference]: With dead ends: 19 [2018-11-23 11:23:49,310 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:23:49,311 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:23:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:23:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:23:49,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:49,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:49,328 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:49,328 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:49,330 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:23:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:23:49,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:49,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:49,331 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:49,331 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:49,333 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:23:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:23:49,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:49,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:49,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:49,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:23:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 11:23:49,336 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 11:23:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:49,336 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 11:23:49,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:23:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:23:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:23:49,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:49,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:49,338 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:49,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 137668885, now seen corresponding path program 1 times [2018-11-23 11:23:49,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:49,338 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:23:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:49,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:49,642 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 11:23:50,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2018-11-23 11:23:50,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2018-11-23 11:23:50,206 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #37#return; {253#true} is VALID [2018-11-23 11:23:50,206 INFO L256 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret2 := main(); {253#true} is VALID [2018-11-23 11:23:50,207 INFO L273 TraceCheckUtils]: 4: Hoare triple {253#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {270#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:50,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {270#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {274#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:50,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(4bv32 == ~i~0); {274#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:50,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {281#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:50,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {281#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {285#(and (not (bvsle (_ bv2 32) main_~n~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-23 11:23:50,218 INFO L256 TraceCheckUtils]: 9: Hoare triple {285#(and (not (bvsle (_ bv2 32) main_~n~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {289#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:50,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {289#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {293#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:50,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {293#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {254#false} is VALID [2018-11-23 11:23:50,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {254#false} assume !false; {254#false} is VALID [2018-11-23 11:23:50,224 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:23:50,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:51,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {254#false} assume !false; {254#false} is VALID [2018-11-23 11:23:51,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {303#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {254#false} is VALID [2018-11-23 11:23:51,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {307#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {303#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:23:51,080 INFO L256 TraceCheckUtils]: 9: Hoare triple {311#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {307#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:23:51,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {315#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} assume !~bvsle32(~i~0, ~n~0); {311#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:51,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {315#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:51,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {319#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} assume !(4bv32 == ~i~0); {319#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:51,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {326#(or (= (_ bv4294967294 32) main_~sn~0) (forall ((main_~n~0 (_ BitVec 32))) (or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {319#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:51,122 INFO L273 TraceCheckUtils]: 4: Hoare triple {253#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {326#(or (= (_ bv4294967294 32) main_~sn~0) (forall ((main_~n~0 (_ BitVec 32))) (or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))))} is VALID [2018-11-23 11:23:51,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret2 := main(); {253#true} is VALID [2018-11-23 11:23:51,123 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #37#return; {253#true} is VALID [2018-11-23 11:23:51,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2018-11-23 11:23:51,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2018-11-23 11:23:51,125 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:23:51,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:51,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:23:51,130 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 11:23:51,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:51,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:23:51,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:51,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:23:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:23:51,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:23:51,211 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 14 states. [2018-11-23 11:23:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:52,175 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 11:23:52,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:23:52,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-11-23 11:23:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:23:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2018-11-23 11:23:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:23:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2018-11-23 11:23:52,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2018-11-23 11:23:52,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:52,277 INFO L225 Difference]: With dead ends: 33 [2018-11-23 11:23:52,278 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:23:52,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:23:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:23:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 11:23:52,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:52,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 11:23:52,291 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 11:23:52,291 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 11:23:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:52,294 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 11:23:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:23:52,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:52,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:52,295 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 11:23:52,295 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 11:23:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:52,297 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 11:23:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:23:52,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:52,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:52,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:52,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:23:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 11:23:52,300 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 11:23:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:52,301 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 11:23:52,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:23:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 11:23:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:23:52,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:52,302 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:52,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:52,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:52,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2110192267, now seen corresponding path program 1 times [2018-11-23 11:23:52,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:52,303 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:23:52,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:52,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:52,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-23 11:23:52,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-23 11:23:52,396 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #37#return; {471#true} is VALID [2018-11-23 11:23:52,397 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret2 := main(); {471#true} is VALID [2018-11-23 11:23:52,397 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {488#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:52,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {488#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {488#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:52,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(4bv32 == ~i~0); {488#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:52,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {498#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:23:52,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {498#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {498#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:23:52,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {498#(= (_ bv2 32) main_~i~0)} assume 4bv32 == ~i~0;~sn~0 := 4294967286bv32; {472#false} is VALID [2018-11-23 11:23:52,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {472#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {472#false} is VALID [2018-11-23 11:23:52,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {472#false} assume !~bvsle32(~i~0, ~n~0); {472#false} is VALID [2018-11-23 11:23:52,406 INFO L256 TraceCheckUtils]: 12: Hoare triple {472#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {472#false} is VALID [2018-11-23 11:23:52,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-23 11:23:52,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} assume 0bv32 == ~cond; {472#false} is VALID [2018-11-23 11:23:52,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-23 11:23:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:52,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:52,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-23 11:23:52,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} assume 0bv32 == ~cond; {472#false} is VALID [2018-11-23 11:23:52,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-23 11:23:52,542 INFO L256 TraceCheckUtils]: 12: Hoare triple {472#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {472#false} is VALID [2018-11-23 11:23:52,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {472#false} assume !~bvsle32(~i~0, ~n~0); {472#false} is VALID [2018-11-23 11:23:52,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {472#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {472#false} is VALID [2018-11-23 11:23:52,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#(not (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} assume 4bv32 == ~i~0;~sn~0 := 4294967286bv32; {472#false} is VALID [2018-11-23 11:23:52,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {541#(not (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {541#(not (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:52,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {548#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {541#(not (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:52,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {548#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(4bv32 == ~i~0); {548#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:52,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {548#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {548#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:52,550 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {548#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:52,550 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret2 := main(); {471#true} is VALID [2018-11-23 11:23:52,550 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #37#return; {471#true} is VALID [2018-11-23 11:23:52,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-23 11:23:52,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-23 11:23:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:52,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:23:52,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:23:52,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:52,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:23:52,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:23:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:23:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:23:52,588 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 11:23:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:52,808 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 11:23:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:23:52,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:23:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:23:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-23 11:23:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:23:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-23 11:23:52,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2018-11-23 11:23:52,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:52,898 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:23:52,898 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:23:52,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:23:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:23:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:23:52,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:52,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:23:52,915 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:23:52,915 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:23:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:52,918 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:23:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:23:52,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:52,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:52,919 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:23:52,919 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:23:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:52,922 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:23:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 11:23:52,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:52,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:52,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:52,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:23:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:23:52,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2018-11-23 11:23:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:52,925 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:23:52,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:23:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:23:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:23:52,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:52,927 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:52,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:52,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 370288085, now seen corresponding path program 2 times [2018-11-23 11:23:52,928 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:52,928 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:23:52,946 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:52,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:23:52,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:53,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:53,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 11:23:53,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 11:23:53,543 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {701#true} {701#true} #37#return; {701#true} is VALID [2018-11-23 11:23:53,543 INFO L256 TraceCheckUtils]: 3: Hoare triple {701#true} call #t~ret2 := main(); {701#true} is VALID [2018-11-23 11:23:53,543 INFO L273 TraceCheckUtils]: 4: Hoare triple {701#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {718#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:53,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {718#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {722#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:53,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {722#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(4bv32 == ~i~0); {722#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:53,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {722#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {729#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:53,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {729#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {733#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:53,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {733#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} assume !(4bv32 == ~i~0); {733#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:53,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {733#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {740#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-23 11:23:53,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {744#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:53,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {744#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(4bv32 == ~i~0); {744#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:53,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {744#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {751#(and (= (_ bv6 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-23 11:23:53,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {751#(and (= (_ bv6 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {755#(and (= (_ bv6 32) main_~sn~0) (bvsle (_ bv3 32) main_~n~0) (not (bvsle (_ bv4 32) main_~n~0)))} is VALID [2018-11-23 11:23:53,569 INFO L256 TraceCheckUtils]: 15: Hoare triple {755#(and (= (_ bv6 32) main_~sn~0) (bvsle (_ bv3 32) main_~n~0) (not (bvsle (_ bv4 32) main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {759#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:53,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {759#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {763#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:53,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {763#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {702#false} is VALID [2018-11-23 11:23:53,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 11:23:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:53,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:55,563 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 11:23:55,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {773#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {702#false} is VALID [2018-11-23 11:23:55,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {777#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {773#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:23:55,578 INFO L256 TraceCheckUtils]: 15: Hoare triple {781#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {777#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:23:55,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {785#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} assume !~bvsle32(~i~0, ~n~0); {781#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {789#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {785#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {789#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} assume !(4bv32 == ~i~0); {789#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {796#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {789#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {796#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {800#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} assume !(4bv32 == ~i~0); {800#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {807#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {800#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {811#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {807#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {811#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} assume !(4bv32 == ~i~0); {811#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {818#(or (forall ((main_~n~0 (_ BitVec 32))) (or (= (bvadd main_~sn~0 (_ bv6 32)) (bvmul (_ bv2 32) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))) (= (_ bv4294967290 32) main_~sn~0))} assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {811#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:55,843 INFO L273 TraceCheckUtils]: 4: Hoare triple {701#true} havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {818#(or (forall ((main_~n~0 (_ BitVec 32))) (or (= (bvadd main_~sn~0 (_ bv6 32)) (bvmul (_ bv2 32) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-23 11:23:55,844 INFO L256 TraceCheckUtils]: 3: Hoare triple {701#true} call #t~ret2 := main(); {701#true} is VALID [2018-11-23 11:23:55,844 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {701#true} {701#true} #37#return; {701#true} is VALID [2018-11-23 11:23:55,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 11:23:55,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 11:23:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:55,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:55,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:23:55,853 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2018-11-23 11:23:55,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:55,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:23:56,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:56,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:23:56,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:23:56,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:23:56,119 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 22 states. [2018-11-23 11:23:57,263 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:23:58,066 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:23:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:58,914 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 11:23:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:23:58,915 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2018-11-23 11:23:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:23:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2018-11-23 11:23:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:23:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2018-11-23 11:23:58,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2018-11-23 11:23:59,235 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:23:59,238 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:23:59,238 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:23:59,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:23:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:23:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 11:23:59,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:59,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 11:23:59,307 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:23:59,307 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:23:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:59,310 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 11:23:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 11:23:59,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:59,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:59,311 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 11:23:59,311 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 11:23:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:59,313 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 11:23:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 11:23:59,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:59,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:59,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:59,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:23:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 11:23:59,317 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2018-11-23 11:23:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:59,317 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 11:23:59,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:23:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 11:23:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:23:59,318 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:59,319 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:59,319 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:59,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 66146485, now seen corresponding path program 2 times [2018-11-23 11:23:59,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:59,320 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:23:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:59,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:23:59,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 11:23:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:23:59,451 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv2 32)] [?] assume !(4bv32 == ~i~0); VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv2 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv2 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv2 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4 32)] [?] assume !(4bv32 == ~i~0); VAL [main_~i~0=(_ bv2 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv3 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv3 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !(4bv32 == ~i~0); VAL [main_~i~0=(_ bv3 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv4 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv4 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv8 32)] [?] assume 4bv32 == ~i~0;~sn~0 := 4294967286bv32; VAL [main_~i~0=(_ bv4 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4294967286 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv5 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4294967286 32)] [?] assume !~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv5 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4294967286 32)] [?] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] assume 4bv32 == ~i~0; [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] assume !~bvsle32(~i~0, ~n~0); VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] assume 4bv32 == ~i~0; [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] assume !~bvsle32(~i~0, ~n~0); VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=4, n=0] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=4, n=-10] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:23:59,536 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:23:59,537 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:23:59,537 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:23:59,537 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:23:59,538 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:23:59,538 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:23:59,538 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:23:59,539 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:23:59,539 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:23:59,539 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:23:59,539 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:23:59,539 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:23:59,540 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:23:59,541 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:23:59,541 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:23:59,541 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:23:59,541 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:23:59,541 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:23:59,541 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:23:59,542 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:23:59,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:23:59 BoogieIcfgContainer [2018-11-23 11:23:59,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:23:59,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:23:59,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:23:59,546 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:23:59,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:47" (3/4) ... [2018-11-23 11:23:59,551 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret2 := main(); [?] havoc ~i~0;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv2 32)] [?] assume !(4bv32 == ~i~0); VAL [main_~i~0=(_ bv1 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv2 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv2 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv2 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4 32)] [?] assume !(4bv32 == ~i~0); VAL [main_~i~0=(_ bv2 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv3 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv3 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !(4bv32 == ~i~0); VAL [main_~i~0=(_ bv3 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv4 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, ~n~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv4 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv8 32)] [?] assume 4bv32 == ~i~0;~sn~0 := 4294967286bv32; VAL [main_~i~0=(_ bv4 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4294967286 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv5 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4294967286 32)] [?] assume !~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv5 32), main_~n~0=(_ bv4 32), main_~sn~0=(_ bv4294967286 32)] [?] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] assume 4bv32 == ~i~0; [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] assume !~bvsle32(~i~0, ~n~0); VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] assume !(4bv32 == ~i~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, ~n~0); [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] assume 4bv32 == ~i~0; [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] assume !~bvsle32(~i~0, ~n~0); VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=1bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=2bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L15] COND FALSE !(4bv32 == ~i~0) VAL [~i~0=3bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, ~n~0)) [L14] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=8bv32] [L15] COND TRUE 4bv32 == ~i~0 [L15] ~sn~0 := 4294967286bv32; VAL [~i~0=4bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=5bv32, ~n~0=4bv32, ~sn~0=4294967286bv32] [L17] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=4, n=0] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=4, n=2] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L13] i++ VAL [i=4, n=4, n=6] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=4, n=-10] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=4, n=-10] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:23:59,640 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:23:59,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:23:59,642 INFO L168 Benchmark]: Toolchain (without parser) took 12821.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -125.6 MB). Peak memory consumption was 566.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:59,643 INFO L168 Benchmark]: CDTParser took 0.23 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:23:59,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:59,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.75 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:23:59,645 INFO L168 Benchmark]: Boogie Preprocessor took 30.57 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:23:59,647 INFO L168 Benchmark]: RCFGBuilder took 635.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:59,648 INFO L168 Benchmark]: TraceAbstraction took 11704.68 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: 587.9 MB). Peak memory consumption was 587.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:59,648 INFO L168 Benchmark]: Witness Printer took 94.42 ms. Allocated memory is still 2.2 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:23:59,657 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.23 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 322.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.75 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 30.57 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 635.64 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -738.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11704.68 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: 587.9 MB). Peak memory consumption was 587.9 MB. Max. memory is 7.1 GB. * Witness Printer took 94.42 ms. Allocated memory is still 2.2 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=4, n=0] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=4, n=-10] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 11.6s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 27 SDslu, 199 SDs, 0 SdLazy, 277 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 108 ConstructedInterpolants, 2 QuantifiedInterpolants, 10197 SizeOfPredicates, 11 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 6/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...