java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:07,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:07,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:07,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:07,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:07,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:07,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:07,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:07,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:07,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:07,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:07,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:07,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:07,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:07,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:07,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:07,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:07,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:07,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:07,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:07,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:07,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:07,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:07,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:07,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:07,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:07,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:07,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:07,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:07,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:07,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:07,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:07,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:07,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:07,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:07,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:07,772 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:24:07,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:07,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:07,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:07,789 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:07,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:07,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:07,790 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:07,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:07,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:07,791 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:07,791 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:07,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:07,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:07,791 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:07,791 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:07,792 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:07,792 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:07,792 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:07,792 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:07,792 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:07,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:07,793 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:07,793 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:07,793 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:07,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:07,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:07,794 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:07,794 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:07,794 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:07,795 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:07,795 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:07,795 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:07,795 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:07,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:07,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:07,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:07,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:07,876 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:07,877 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 11:24:07,938 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d40716f/0f54787d87a04f68b563d41aa8bc6664/FLAG77b1029e3 [2018-11-23 11:24:08,425 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:08,426 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 11:24:08,434 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d40716f/0f54787d87a04f68b563d41aa8bc6664/FLAG77b1029e3 [2018-11-23 11:24:08,752 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d40716f/0f54787d87a04f68b563d41aa8bc6664 [2018-11-23 11:24:08,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:08,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:08,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:08,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:08,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:08,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:08" (1/1) ... [2018-11-23 11:24:08,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f4ee5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:08, skipping insertion in model container [2018-11-23 11:24:08,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:08" (1/1) ... [2018-11-23 11:24:08,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:08,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:09,060 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:09,067 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:09,088 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:09,106 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:09,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09 WrapperNode [2018-11-23 11:24:09,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:09,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:09,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:09,108 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:09,118 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:24:09" (1/1) ... [2018-11-23 11:24:09,126 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:24:09" (1/1) ... [2018-11-23 11:24:09,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:09,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:09,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:09,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:09,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (1/1) ... [2018-11-23 11:24:09,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:09,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:09,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:09,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:09,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (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:24:09,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:09,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:09,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:09,731 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:09,732 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:24:09,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:09 BoogieIcfgContainer [2018-11-23 11:24:09,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:09,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:09,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:09,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:09,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:08" (1/3) ... [2018-11-23 11:24:09,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c3040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:09, skipping insertion in model container [2018-11-23 11:24:09,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:09" (2/3) ... [2018-11-23 11:24:09,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364c3040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:09, skipping insertion in model container [2018-11-23 11:24:09,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:09" (3/3) ... [2018-11-23 11:24:09,740 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_false-unreach-call_true-termination.i [2018-11-23 11:24:09,751 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:09,761 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:09,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:09,814 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:09,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:09,815 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:09,815 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:09,815 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:09,816 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:09,816 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:09,816 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:09,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:24:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:24:09,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:09,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:09,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:09,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 11:24:09,859 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:09,859 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:24:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:09,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:09,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:24:09,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:24:09,997 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2018-11-23 11:24:09,997 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-23 11:24:09,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {22#true} is VALID [2018-11-23 11:24:09,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 11:24:09,999 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-23 11:24:10,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 11:24:10,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:24:10,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:24:10,003 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:24:10,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:10,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:24:10,012 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:24:10,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:10,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:24:10,066 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:24:10,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:24:10,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:24:10,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:10,077 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 11:24:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:10,154 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:24:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:24:10,154 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:24:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 11:24:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 11:24:10,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 11:24:10,504 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:24:10,518 INFO L225 Difference]: With dead ends: 30 [2018-11-23 11:24:10,518 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:24:10,526 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:24:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:24:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 11:24:10,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:10,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 11:24:10,593 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:24:10,593 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:24:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:10,596 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:24:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:24:10,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:10,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:10,598 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 11:24:10,598 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 11:24:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:10,601 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 11:24:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:24:10,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:10,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:10,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:10,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:24:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 11:24:10,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 11:24:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:10,607 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 11:24:10,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:24:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 11:24:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:24:10,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:10,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:10,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:10,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 11:24:10,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:10,610 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:24:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:10,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:10,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-23 11:24:10,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-23 11:24:10,782 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #37#return; {138#true} is VALID [2018-11-23 11:24:10,782 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret1 := main(); {138#true} is VALID [2018-11-23 11:24:10,800 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:24:10,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} assume !~bvsle32(~i~0, 8bv32); {155#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:24:10,809 INFO L256 TraceCheckUtils]: 6: Hoare triple {155#(= (_ bv0 32) main_~sn~0)} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {162#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:10,811 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:24:10,817 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:24:10,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-23 11:24:10,819 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:24:10,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:10,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:10,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:24:10,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:24:10,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:10,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:24:10,897 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:24:10,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:24:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:24:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:24:10,898 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 11:24:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:11,160 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 11:24:11,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:24:11,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:24:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 11:24:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 11:24:11,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 11:24:11,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:11,217 INFO L225 Difference]: With dead ends: 21 [2018-11-23 11:24:11,217 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:24:11,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:24:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:24:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 11:24:11,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:11,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:11,239 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:11,239 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:11,241 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:24:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:24:11,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:11,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:11,242 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:11,242 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 11:24:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:11,244 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 11:24:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:24:11,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:11,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:11,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:11,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:24:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 11:24:11,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 11:24:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:11,248 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 11:24:11,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:24:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 11:24:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:24:11,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:11,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:11,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:11,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2018-11-23 11:24:11,251 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:11,251 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:24:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:11,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:11,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-23 11:24:11,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-23 11:24:11,472 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {261#true} {261#true} #37#return; {261#true} is VALID [2018-11-23 11:24:11,472 INFO L256 TraceCheckUtils]: 3: Hoare triple {261#true} call #t~ret1 := main(); {261#true} is VALID [2018-11-23 11:24:11,485 INFO L273 TraceCheckUtils]: 4: Hoare triple {261#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {278#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:11,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {278#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:11,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {278#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {278#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:11,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {288#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:11,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {288#(= (_ bv2 32) main_~i~0)} assume !~bvsle32(~i~0, 8bv32); {262#false} is VALID [2018-11-23 11:24:11,537 INFO L256 TraceCheckUtils]: 9: Hoare triple {262#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {262#false} is VALID [2018-11-23 11:24:11,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {262#false} ~cond := #in~cond; {262#false} is VALID [2018-11-23 11:24:11,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {262#false} assume 0bv32 == ~cond; {262#false} is VALID [2018-11-23 11:24:11,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-23 11:24:11,540 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:24:11,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:24:11,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-23 11:24:11,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {262#false} assume 0bv32 == ~cond; {262#false} is VALID [2018-11-23 11:24:11,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {262#false} ~cond := #in~cond; {262#false} is VALID [2018-11-23 11:24:11,806 INFO L256 TraceCheckUtils]: 9: Hoare triple {262#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {262#false} is VALID [2018-11-23 11:24:11,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {316#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {262#false} is VALID [2018-11-23 11:24:11,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {320#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {316#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-23 11:24:11,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {320#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {320#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:11,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {320#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {320#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:11,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {261#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {320#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:11,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {261#true} call #t~ret1 := main(); {261#true} is VALID [2018-11-23 11:24:11,811 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {261#true} {261#true} #37#return; {261#true} is VALID [2018-11-23 11:24:11,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-23 11:24:11,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-23 11:24:11,813 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:24:11,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:11,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:24:11,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:24:11,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:11,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:24:11,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:11,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:24:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:24:11,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:24:11,920 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2018-11-23 11:24:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:12,221 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-23 11:24:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:24:12,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:24:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 11:24:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:24:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 11:24:12,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 11:24:12,306 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:24:12,307 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:24:12,307 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:24:12,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:24:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:24:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:24:12,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:12,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:24:12,334 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:24:12,334 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:24:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:12,337 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:24:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:24:12,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:12,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:12,338 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:24:12,338 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:24:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:12,340 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:24:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:24:12,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:12,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:12,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:12,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:24:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:24:12,344 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2018-11-23 11:24:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:12,344 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:24:12,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:24:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:24:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:24:12,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:12,346 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:12,346 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:12,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:12,347 INFO L82 PathProgramCache]: Analyzing trace with hash -845939081, now seen corresponding path program 1 times [2018-11-23 11:24:12,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:12,347 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:24:12,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:12,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:12,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-23 11:24:12,537 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-23 11:24:12,537 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #37#return; {475#true} is VALID [2018-11-23 11:24:12,538 INFO L256 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret1 := main(); {475#true} is VALID [2018-11-23 11:24:12,541 INFO L273 TraceCheckUtils]: 4: Hoare triple {475#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:12,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:12,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:12,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {502#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:12,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {502#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32); {502#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:12,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {502#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {502#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:12,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {502#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {512#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:12,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {512#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {512#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:12,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {512#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 4bv32); {476#false} is VALID [2018-11-23 11:24:12,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {476#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {476#false} is VALID [2018-11-23 11:24:12,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#false} assume !!~bvsle32(~i~0, 8bv32); {476#false} is VALID [2018-11-23 11:24:12,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} assume !~bvslt32(~i~0, 4bv32); {476#false} is VALID [2018-11-23 11:24:12,554 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {476#false} is VALID [2018-11-23 11:24:12,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {476#false} assume !~bvsle32(~i~0, 8bv32); {476#false} is VALID [2018-11-23 11:24:12,555 INFO L256 TraceCheckUtils]: 18: Hoare triple {476#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {476#false} is VALID [2018-11-23 11:24:12,556 INFO L273 TraceCheckUtils]: 19: Hoare triple {476#false} ~cond := #in~cond; {476#false} is VALID [2018-11-23 11:24:12,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {476#false} assume 0bv32 == ~cond; {476#false} is VALID [2018-11-23 11:24:12,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-23 11:24:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:24:12,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:24:12,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-23 11:24:12,743 INFO L273 TraceCheckUtils]: 20: Hoare triple {476#false} assume 0bv32 == ~cond; {476#false} is VALID [2018-11-23 11:24:12,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {476#false} ~cond := #in~cond; {476#false} is VALID [2018-11-23 11:24:12,743 INFO L256 TraceCheckUtils]: 18: Hoare triple {476#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {476#false} is VALID [2018-11-23 11:24:12,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {476#false} assume !~bvsle32(~i~0, 8bv32); {476#false} is VALID [2018-11-23 11:24:12,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {476#false} is VALID [2018-11-23 11:24:12,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} assume !~bvslt32(~i~0, 4bv32); {476#false} is VALID [2018-11-23 11:24:12,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#false} assume !!~bvsle32(~i~0, 8bv32); {476#false} is VALID [2018-11-23 11:24:12,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {476#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {476#false} is VALID [2018-11-23 11:24:12,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {573#(bvslt main_~i~0 (_ bv4 32))} assume !~bvslt32(~i~0, 4bv32); {476#false} is VALID [2018-11-23 11:24:12,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {573#(bvslt main_~i~0 (_ bv4 32))} assume !!~bvsle32(~i~0, 8bv32); {573#(bvslt main_~i~0 (_ bv4 32))} is VALID [2018-11-23 11:24:12,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {580#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv4 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {573#(bvslt main_~i~0 (_ bv4 32))} is VALID [2018-11-23 11:24:12,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {580#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv4 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {580#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-23 11:24:12,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {580#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv4 32))} assume !!~bvsle32(~i~0, 8bv32); {580#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-23 11:24:12,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv4 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {580#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-23 11:24:12,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv4 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {590#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv4 32))} is VALID [2018-11-23 11:24:12,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv4 32))} assume !!~bvsle32(~i~0, 8bv32); {590#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv4 32))} is VALID [2018-11-23 11:24:12,755 INFO L273 TraceCheckUtils]: 4: Hoare triple {475#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {590#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv4 32))} is VALID [2018-11-23 11:24:12,755 INFO L256 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret1 := main(); {475#true} is VALID [2018-11-23 11:24:12,755 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #37#return; {475#true} is VALID [2018-11-23 11:24:12,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-23 11:24:12,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-23 11:24:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:24:12,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:12,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:24:12,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:24:12,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:12,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:24:12,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:12,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:24:12,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:24:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:24:12,843 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2018-11-23 11:24:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:13,144 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:24:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:24:13,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 11:24:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:24:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-23 11:24:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:24:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-23 11:24:13,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2018-11-23 11:24:13,209 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:24:13,211 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:24:13,211 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:24:13,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:24:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:24:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 11:24:13,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:13,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 11:24:13,227 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 11:24:13,227 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 11:24:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:13,229 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:24:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:24:13,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:13,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:13,230 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 11:24:13,230 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 11:24:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:13,232 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 11:24:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:24:13,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:13,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:13,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:13,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:24:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 11:24:13,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-11-23 11:24:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:13,236 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 11:24:13,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:24:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:24:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:24:13,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:13,237 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:13,237 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:13,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -452912071, now seen corresponding path program 2 times [2018-11-23 11:24:13,238 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:13,238 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:24:13,256 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:24:13,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:24:13,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:24:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:13,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:13,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {745#true} call ULTIMATE.init(); {745#true} is VALID [2018-11-23 11:24:13,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {745#true} assume true; {745#true} is VALID [2018-11-23 11:24:13,410 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {745#true} {745#true} #37#return; {745#true} is VALID [2018-11-23 11:24:13,411 INFO L256 TraceCheckUtils]: 3: Hoare triple {745#true} call #t~ret1 := main(); {745#true} is VALID [2018-11-23 11:24:13,414 INFO L273 TraceCheckUtils]: 4: Hoare triple {745#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {762#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {762#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {762#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {762#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {772#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:13,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {772#(= (_ bv2 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32); {772#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:13,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {772#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {772#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:24:13,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {772#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {782#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {782#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, 8bv32); {782#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {782#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {782#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {782#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {792#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:24:13,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {792#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, 8bv32); {792#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:24:13,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {792#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 4bv32); {792#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:24:13,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {792#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {802#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:13,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {802#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsle32(~i~0, 8bv32); {746#false} is VALID [2018-11-23 11:24:13,435 INFO L256 TraceCheckUtils]: 18: Hoare triple {746#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {746#false} is VALID [2018-11-23 11:24:13,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {746#false} ~cond := #in~cond; {746#false} is VALID [2018-11-23 11:24:13,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {746#false} assume 0bv32 == ~cond; {746#false} is VALID [2018-11-23 11:24:13,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {746#false} assume !false; {746#false} is VALID [2018-11-23 11:24:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:13,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:24:13,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {746#false} assume !false; {746#false} is VALID [2018-11-23 11:24:13,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {746#false} assume 0bv32 == ~cond; {746#false} is VALID [2018-11-23 11:24:13,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {746#false} ~cond := #in~cond; {746#false} is VALID [2018-11-23 11:24:13,619 INFO L256 TraceCheckUtils]: 18: Hoare triple {746#false} call __VERIFIER_assert((if 16bv32 == ~sn~0 || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {746#false} is VALID [2018-11-23 11:24:13,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {830#(bvsle main_~i~0 (_ bv8 32))} assume !~bvsle32(~i~0, 8bv32); {746#false} is VALID [2018-11-23 11:24:13,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {834#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {830#(bvsle main_~i~0 (_ bv8 32))} is VALID [2018-11-23 11:24:13,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {834#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !~bvslt32(~i~0, 4bv32); {834#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {834#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {834#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {844#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {834#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {844#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {844#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {844#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {844#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {854#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {844#(bvsle (bvadd main_~i~0 (_ bv2 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {854#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {854#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {854#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {854#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {864#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {854#(bvsle (bvadd main_~i~0 (_ bv3 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {864#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); {864#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {864#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} assume !!~bvsle32(~i~0, 8bv32); {864#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,656 INFO L273 TraceCheckUtils]: 4: Hoare triple {745#true} havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; {864#(bvsle (bvadd main_~i~0 (_ bv4 32)) (_ bv8 32))} is VALID [2018-11-23 11:24:13,656 INFO L256 TraceCheckUtils]: 3: Hoare triple {745#true} call #t~ret1 := main(); {745#true} is VALID [2018-11-23 11:24:13,656 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {745#true} {745#true} #37#return; {745#true} is VALID [2018-11-23 11:24:13,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {745#true} assume true; {745#true} is VALID [2018-11-23 11:24:13,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {745#true} call ULTIMATE.init(); {745#true} is VALID [2018-11-23 11:24:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:13,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:13,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:24:13,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 11:24:13,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:13,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:24:13,737 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:24:13,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:24:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:24:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:24:13,739 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-11-23 11:24:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:14,573 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 11:24:14,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:24:14,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 11:24:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:24:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2018-11-23 11:24:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:24:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2018-11-23 11:24:14,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2018-11-23 11:24:14,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:14,683 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:24:14,683 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:24:14,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:24:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:24:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 11:24:14,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:14,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 11:24:14,735 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 11:24:14,735 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 11:24:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:14,738 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:24:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:24:14,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:14,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:14,739 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 11:24:14,739 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 11:24:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:14,742 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 11:24:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:24:14,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:14,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:14,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:14,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:24:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 11:24:14,746 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 22 [2018-11-23 11:24:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:14,746 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 11:24:14,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:24:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 11:24:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:24:14,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:14,748 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:14,748 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:14,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash 749989817, now seen corresponding path program 3 times [2018-11-23 11:24:14,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:14,749 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:24:14,778 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:24:14,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 11:24:14,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 11:24:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:14,977 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~ret1 := main(); [?] havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), main_~sn~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv1 32), main_~sn~0=(_ bv0 32)] [?] assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv1 32), main_~sn~0=(_ bv2 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv2 32), main_~sn~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv2 32), main_~sn~0=(_ bv2 32)] [?] assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv2 32), main_~sn~0=(_ bv4 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv3 32), main_~sn~0=(_ bv4 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv3 32), main_~sn~0=(_ bv4 32)] [?] assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv3 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv5 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv5 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv5 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv7 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv7 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv7 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv8 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv8 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv8 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv9 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv9 32), main_~sn~0=(_ bv6 32)] [?] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=1bv32, ~sn~0=0bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=2bv32, ~sn~0=2bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=3bv32, ~sn~0=4bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] assume !~bvsle32(~i~0, 8bv32); VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=1bv32, ~sn~0=0bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=2bv32, ~sn~0=2bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=3bv32, ~sn~0=4bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] assume !~bvsle32(~i~0, 8bv32); VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(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:24:15,083 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:24:15,087 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:15,087 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:15,087 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:24:15,087 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:24:15,087 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:24:15,088 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:15,088 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:15,088 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:24:15,088 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:24:15,088 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 11:24:15,088 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:15,089 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:15,089 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:24:15,089 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 11:24:15,089 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 11:24:15,089 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:24:15,089 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 11:24:15,090 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:24:15,092 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:24:15,092 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:24:15,092 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:24:15,092 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:24:15,092 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:24:15,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:24:15,093 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:24:15,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:24:15 BoogieIcfgContainer [2018-11-23 11:24:15,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:24:15,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:24:15,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:24:15,099 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:24:15,100 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:09" (3/4) ... [2018-11-23 11:24:15,106 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~ret1 := main(); [?] havoc ~i~0;~sn~0 := 0bv32;~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), main_~sn~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv1 32), main_~sn~0=(_ bv0 32)] [?] assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv1 32), main_~sn~0=(_ bv2 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv2 32), main_~sn~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv2 32), main_~sn~0=(_ bv2 32)] [?] assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv2 32), main_~sn~0=(_ bv4 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv3 32), main_~sn~0=(_ bv4 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv3 32), main_~sn~0=(_ bv4 32)] [?] assume ~bvslt32(~i~0, 4bv32);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv3 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv4 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv5 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv5 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv5 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv7 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv7 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv7 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv8 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv8 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvslt32(~i~0, 4bv32); VAL [main_~i~0=(_ bv8 32), main_~sn~0=(_ bv6 32)] [?] #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv9 32), main_~sn~0=(_ bv6 32)] [?] assume !~bvsle32(~i~0, 8bv32); VAL [main_~i~0=(_ bv9 32), main_~sn~0=(_ bv6 32)] [?] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=1bv32, ~sn~0=0bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=2bv32, ~sn~0=2bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=3bv32, ~sn~0=4bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] assume !~bvsle32(~i~0, 8bv32); VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=1bv32, ~sn~0=0bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=2bv32, ~sn~0=2bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=3bv32, ~sn~0=4bv32] [L14-L15] assume ~bvslt32(~i~0, 4bv32); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] assume !!~bvsle32(~i~0, 8bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L14-L15] assume !~bvslt32(~i~0, 4bv32); VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] assume !~bvsle32(~i~0, 8bv32); VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~sn~0=0bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=1bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~sn~0=2bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=2bv32, ~sn~0=2bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=2bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~sn~0=4bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=3bv32, ~sn~0=4bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=3bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, 4bv32) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=4bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=4bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=5bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=5bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=6bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=6bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=7bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=7bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=8bv32, ~sn~0=6bv32] [L13-L16] COND FALSE !(!~bvsle32(~i~0, 8bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L14] COND FALSE !(~bvslt32(~i~0, 4bv32)) VAL [~i~0=8bv32, ~sn~0=6bv32] [L13] #t~post0 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post0); [L13] havoc #t~post0; VAL [~i~0=9bv32, ~sn~0=6bv32] [L13-L16] COND TRUE !~bvsle32(~i~0, 8bv32) VAL [~i~0=9bv32, ~sn~0=6bv32] [L17] CALL call __VERIFIER_assert((if 16bv32 == ~sn~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, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(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:24:15,223 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum04_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:24:15,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:24:15,227 INFO L168 Benchmark]: Toolchain (without parser) took 6464.68 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -377.2 MB). Peak memory consumption was 329.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:15,231 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:24:15,232 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.70 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:24:15,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.78 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:24:15,237 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 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:24:15,237 INFO L168 Benchmark]: RCFGBuilder took 562.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:15,238 INFO L168 Benchmark]: TraceAbstraction took 5365.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 364.6 MB). Peak memory consumption was 364.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:15,239 INFO L168 Benchmark]: Witness Printer took 124.58 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:24:15,251 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 342.70 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 28.78 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 33.13 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 562.13 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5365.24 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 364.6 MB). Peak memory consumption was 364.6 MB. Max. memory is 7.1 GB. * Witness Printer took 124.58 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(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, 5.2s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 47 SDslu, 137 SDs, 0 SdLazy, 161 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 5682 SizeOfPredicates, 5 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 30/90 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...