java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:41,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:41,843 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:41,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:41,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:41,866 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:41,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:41,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:41,874 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:41,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:41,877 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:41,877 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:41,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:41,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:41,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:41,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:41,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:41,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:41,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:41,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:41,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:41,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:41,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:41,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:41,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:41,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:41,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:41,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:41,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:41,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:41,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:41,921 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:41,921 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:41,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:41,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:41,923 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:41,923 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:53:41,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:41,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:41,959 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:41,959 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:41,960 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:41,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:41,961 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:41,961 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:41,962 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:41,963 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:41,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:41,964 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:41,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:41,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:41,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:41,966 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:41,966 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:41,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:41,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:41,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:41,967 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:41,967 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:41,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:41,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:41,968 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:42,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:42,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:42,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:42,054 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:42,054 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:42,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-23 12:53:42,125 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5acb95fe/253b5945f0ea401ea1ba498ac7311b48/FLAG5e882938b [2018-11-23 12:53:42,576 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:42,576 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i [2018-11-23 12:53:42,584 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5acb95fe/253b5945f0ea401ea1ba498ac7311b48/FLAG5e882938b [2018-11-23 12:53:42,935 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5acb95fe/253b5945f0ea401ea1ba498ac7311b48 [2018-11-23 12:53:42,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:42,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:42,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:42,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:42,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:42,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:42" (1/1) ... [2018-11-23 12:53:42,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340dfb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:42, skipping insertion in model container [2018-11-23 12:53:42,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:42" (1/1) ... [2018-11-23 12:53:42,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:42,998 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:43,241 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:43,246 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:43,264 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:43,282 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:43,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43 WrapperNode [2018-11-23 12:53:43,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:43,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:43,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:43,284 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:43,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:43,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:43,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:43,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:43,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (1/1) ... [2018-11-23 12:53:43,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:43,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:43,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:43,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:43,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (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 12:53:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:43,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure check_error [2018-11-23 12:53:43,471 INFO L138 BoogieDeclarations]: Found implementation of procedure check_error [2018-11-23 12:53:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 12:53:43,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 12:53:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:43,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:43,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:43,890 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:43,891 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:53:43,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:43 BoogieIcfgContainer [2018-11-23 12:53:43,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:43,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:43,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:43,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:43,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:42" (1/3) ... [2018-11-23 12:53:43,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf8199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:43, skipping insertion in model container [2018-11-23 12:53:43,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:43" (2/3) ... [2018-11-23 12:53:43,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf8199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:43, skipping insertion in model container [2018-11-23 12:53:43,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:43" (3/3) ... [2018-11-23 12:53:43,900 INFO L112 eAbstractionObserver]: Analyzing ICFG test_while_int_true-termination.c_false-unreach-call.i [2018-11-23 12:53:43,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:43,918 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:43,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:43,966 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:43,967 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:43,967 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:43,967 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:43,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:43,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:43,968 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:43,968 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:43,968 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 12:53:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:53:43,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:43,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:43,996 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:44,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 708560652, now seen corresponding path program 1 times [2018-11-23 12:53:44,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:44,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:44,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 12:53:44,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 12:53:44,311 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 12:53:44,312 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret1 := main(); {24#true} is VALID [2018-11-23 12:53:44,314 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~i~0 := 0; {26#(<= main_~i~0 0)} is VALID [2018-11-23 12:53:44,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:44,318 INFO L256 TraceCheckUtils]: 6: Hoare triple {27#(<= main_~i~0 1)} call check_error((if 3 != ~i~0 then 1 else 0)); {28#(= |check_error_#in~b| 1)} is VALID [2018-11-23 12:53:44,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#(= |check_error_#in~b| 1)} ~b := #in~b; {29#(= check_error_~b 1)} is VALID [2018-11-23 12:53:44,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#(= check_error_~b 1)} assume !(0 != ~b); {25#false} is VALID [2018-11-23 12:53:44,324 INFO L256 TraceCheckUtils]: 9: Hoare triple {25#false} call __blast_assert(); {25#false} is VALID [2018-11-23 12:53:44,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 12:53:44,327 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 12:53:44,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:44,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:53:44,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 12:53:44,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:44,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:53:44,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:44,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:53:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:53:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:44,423 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2018-11-23 12:53:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:45,431 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2018-11-23 12:53:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:53:45,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 12:53:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:53:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-23 12:53:45,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-23 12:53:45,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:45,576 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:53:45,576 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:53:45,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:53:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 12:53:45,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:45,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 12:53:45,637 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 12:53:45,637 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 12:53:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:45,641 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:53:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:53:45,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:45,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:45,642 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 12:53:45,642 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 12:53:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:45,646 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:53:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:53:45,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:45,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:45,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:45,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:53:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 12:53:45,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2018-11-23 12:53:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:45,652 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 12:53:45,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:53:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 12:53:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:53:45,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:45,654 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:45,654 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:45,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:45,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1910985178, now seen corresponding path program 1 times [2018-11-23 12:53:45,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:45,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:45,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:45,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:46,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-23 12:53:46,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 12:53:46,111 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #35#return; {168#true} is VALID [2018-11-23 12:53:46,111 INFO L256 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret1 := main(); {168#true} is VALID [2018-11-23 12:53:46,112 INFO L273 TraceCheckUtils]: 4: Hoare triple {168#true} ~i~0 := 0; {170#(<= main_~i~0 0)} is VALID [2018-11-23 12:53:46,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {170#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {171#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:46,113 INFO L256 TraceCheckUtils]: 6: Hoare triple {171#(<= main_~i~0 1)} call check_error((if 3 != ~i~0 then 1 else 0)); {168#true} is VALID [2018-11-23 12:53:46,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {168#true} ~b := #in~b; {172#(= check_error_~b |check_error_#in~b|)} is VALID [2018-11-23 12:53:46,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {172#(= check_error_~b |check_error_#in~b|)} assume 0 != ~b; {173#(not (= 0 |check_error_#in~b|))} is VALID [2018-11-23 12:53:46,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {173#(not (= 0 |check_error_#in~b|))} assume true; {173#(not (= 0 |check_error_#in~b|))} is VALID [2018-11-23 12:53:46,127 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {173#(not (= 0 |check_error_#in~b|))} {171#(<= main_~i~0 1)} #39#return; {171#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:46,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {171#(<= main_~i~0 1)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {174#(<= main_~i~0 2)} is VALID [2018-11-23 12:53:46,152 INFO L256 TraceCheckUtils]: 12: Hoare triple {174#(<= main_~i~0 2)} call check_error((if 3 != ~i~0 then 1 else 0)); {173#(not (= 0 |check_error_#in~b|))} is VALID [2018-11-23 12:53:46,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {173#(not (= 0 |check_error_#in~b|))} ~b := #in~b; {175#(not (= 0 check_error_~b))} is VALID [2018-11-23 12:53:46,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {175#(not (= 0 check_error_~b))} assume !(0 != ~b); {169#false} is VALID [2018-11-23 12:53:46,156 INFO L256 TraceCheckUtils]: 15: Hoare triple {169#false} call __blast_assert(); {169#false} is VALID [2018-11-23 12:53:46,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-23 12:53:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:46,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:46,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:53:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:46,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:46,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-23 12:53:46,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 12:53:46,450 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #35#return; {168#true} is VALID [2018-11-23 12:53:46,450 INFO L256 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret1 := main(); {168#true} is VALID [2018-11-23 12:53:46,452 INFO L273 TraceCheckUtils]: 4: Hoare triple {168#true} ~i~0 := 0; {170#(<= main_~i~0 0)} is VALID [2018-11-23 12:53:46,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {170#(<= main_~i~0 0)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {171#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:46,453 INFO L256 TraceCheckUtils]: 6: Hoare triple {171#(<= main_~i~0 1)} call check_error((if 3 != ~i~0 then 1 else 0)); {168#true} is VALID [2018-11-23 12:53:46,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {168#true} ~b := #in~b; {168#true} is VALID [2018-11-23 12:53:46,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {168#true} assume 0 != ~b; {168#true} is VALID [2018-11-23 12:53:46,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {168#true} assume true; {168#true} is VALID [2018-11-23 12:53:46,455 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {168#true} {171#(<= main_~i~0 1)} #39#return; {171#(<= main_~i~0 1)} is VALID [2018-11-23 12:53:46,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {171#(<= main_~i~0 1)} assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {174#(<= main_~i~0 2)} is VALID [2018-11-23 12:53:46,457 INFO L256 TraceCheckUtils]: 12: Hoare triple {174#(<= main_~i~0 2)} call check_error((if 3 != ~i~0 then 1 else 0)); {215#(= |check_error_#in~b| 1)} is VALID [2018-11-23 12:53:46,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#(= |check_error_#in~b| 1)} ~b := #in~b; {219#(= 1 check_error_~b)} is VALID [2018-11-23 12:53:46,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {219#(= 1 check_error_~b)} assume !(0 != ~b); {169#false} is VALID [2018-11-23 12:53:46,460 INFO L256 TraceCheckUtils]: 15: Hoare triple {169#false} call __blast_assert(); {169#false} is VALID [2018-11-23 12:53:46,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-23 12:53:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:53:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:46,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-11-23 12:53:46,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 12:53:46,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:46,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:53:46,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:46,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:53:46,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:53:46,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:53:46,580 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 10 states. [2018-11-23 12:53:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:47,140 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 12:53:47,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:53:47,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 12:53:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:53:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-23 12:53:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:53:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-23 12:53:47,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 27 transitions. [2018-11-23 12:53:47,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:47,188 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:53:47,188 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:47,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:53:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 12:53:47,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:47,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 12:53:47,219 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 12:53:47,219 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 12:53:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:47,221 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 12:53:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 12:53:47,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:47,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:47,222 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 12:53:47,223 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 12:53:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:47,225 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 12:53:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 12:53:47,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:47,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:47,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:47,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:53:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 12:53:47,229 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2018-11-23 12:53:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:47,230 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 12:53:47,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:53:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 12:53:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:53:47,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:47,231 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:47,232 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:47,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1165555160, now seen corresponding path program 2 times [2018-11-23 12:53:47,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:47,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:47,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:47,274 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #35#return; [?] CALL call #t~ret1 := main(); [?] ~i~0 := 0; VAL [main_~i~0=0] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=1] [?] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [|check_error_#in~b|=1] [?] ~b := #in~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume 0 != ~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume true; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] RET #39#return; VAL [main_~i~0=1] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2] [?] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [|check_error_#in~b|=1] [?] ~b := #in~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume 0 != ~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume true; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] RET #39#return; VAL [main_~i~0=2] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3] [?] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [|check_error_#in~b|=0] [?] ~b := #in~b; VAL [check_error_~b=0, |check_error_#in~b|=0] [?] assume !(0 != ~b); VAL [check_error_~b=0, |check_error_#in~b|=0] [?] CALL call __blast_assert(); [?] assume !false; [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] assume !(0 != ~b); VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] assume !(0 != ~b); VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; [L23] int i=0; VAL [i=0] [L24] COND TRUE i<5 [L25] i++ VAL [i=1] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] RET check_error(i!=3) VAL [i=1] [L24] COND TRUE i<5 [L25] i++ VAL [i=2] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] RET check_error(i!=3) VAL [i=2] [L24] COND TRUE i<5 [L25] i++ VAL [i=3] [L29] CALL check_error(i!=3) VAL [\old(b)=0] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=0, b=0] [L18] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 12:53:47,310 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:53:47,311 WARN L170 areAnnotationChecker]: check_errorENTRY has no Hoare annotation [2018-11-23 12:53:47,311 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:47,311 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:47,311 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:47,311 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:47,312 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:53:47,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:53:47,312 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:53:47,312 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:53:47,312 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 12:53:47,312 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 12:53:47,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:53:47,314 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2018-11-23 12:53:47,314 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:53:47,314 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:53:47,314 WARN L170 areAnnotationChecker]: check_errorEXIT has no Hoare annotation [2018-11-23 12:53:47,314 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:53:47,314 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:53:47,314 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 12:53:47,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:47 BoogieIcfgContainer [2018-11-23 12:53:47,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:53:47,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:53:47,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:53:47,318 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:53:47,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:43" (3/4) ... [2018-11-23 12:53:47,321 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 #35#return; [?] CALL call #t~ret1 := main(); [?] ~i~0 := 0; VAL [main_~i~0=0] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=1] [?] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [|check_error_#in~b|=1] [?] ~b := #in~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume 0 != ~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume true; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] RET #39#return; VAL [main_~i~0=1] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2] [?] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [|check_error_#in~b|=1] [?] ~b := #in~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume 0 != ~b; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] assume true; VAL [check_error_~b=1, |check_error_#in~b|=1] [?] RET #39#return; VAL [main_~i~0=2] [?] assume !!(~i~0 < 5);#t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3] [?] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [|check_error_#in~b|=0] [?] ~b := #in~b; VAL [check_error_~b=0, |check_error_#in~b|=0] [?] assume !(0 != ~b); VAL [check_error_~b=0, |check_error_#in~b|=0] [?] CALL call __blast_assert(); [?] assume !false; [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] assume !(0 != ~b); VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] assume 0 != ~b; VAL [#in~b=1, ~b=1] [L17-L19] ensures true; VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] assume !!(~i~0 < 5); [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] assume !(0 != ~b); VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L23] ~i~0 := 0; VAL [~i~0=0] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=1] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=1] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=2] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=1] [L17-L19] ~b := #in~b; VAL [#in~b=1, ~b=1] [L18] COND TRUE 0 != ~b VAL [#in~b=1, ~b=1] [L29] RET call check_error((if 3 != ~i~0 then 1 else 0)); VAL [~i~0=2] [L24-L31] COND FALSE !(!(~i~0 < 5)) [L25] #t~post0 := ~i~0; [L25] ~i~0 := 1 + #t~post0; [L25] havoc #t~post0; VAL [~i~0=3] [L29] CALL call check_error((if 3 != ~i~0 then 1 else 0)); VAL [#in~b=0] [L17-L19] ~b := #in~b; VAL [#in~b=0, ~b=0] [L18] COND FALSE !(0 != ~b) VAL [#in~b=0, ~b=0] [L18] CALL call __blast_assert(); [L6] assert false; [L23] int i=0; VAL [i=0] [L24] COND TRUE i<5 [L25] i++ VAL [i=1] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] RET check_error(i!=3) VAL [i=1] [L24] COND TRUE i<5 [L25] i++ VAL [i=2] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] RET check_error(i!=3) VAL [i=2] [L24] COND TRUE i<5 [L25] i++ VAL [i=3] [L29] CALL check_error(i!=3) VAL [\old(b)=0] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=0, b=0] [L18] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 12:53:47,377 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call.i-witness.graphml [2018-11-23 12:53:47,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:53:47,379 INFO L168 Benchmark]: Toolchain (without parser) took 4430.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -578.1 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:47,380 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:47,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.63 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 12:53:47,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.10 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 12:53:47,383 INFO L168 Benchmark]: Boogie Preprocessor took 30.30 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 12:53:47,383 INFO L168 Benchmark]: RCFGBuilder took 551.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:47,384 INFO L168 Benchmark]: TraceAbstraction took 3424.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:47,385 INFO L168 Benchmark]: Witness Printer took 59.78 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:47,391 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.63 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 26.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.30 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 551.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 716.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3424.80 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 7.1 GB. * Witness Printer took 59.78 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L23] int i=0; VAL [i=0] [L24] COND TRUE i<5 [L25] i++ VAL [i=1] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] RET check_error(i!=3) VAL [i=1] [L24] COND TRUE i<5 [L25] i++ VAL [i=2] [L29] CALL check_error(i!=3) VAL [\old(b)=1] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=1, b=1] [L29] RET check_error(i!=3) VAL [i=2] [L24] COND TRUE i<5 [L25] i++ VAL [i=3] [L29] CALL check_error(i!=3) VAL [\old(b)=0] [L18] (b) ? (0) : __blast_assert () VAL [\old(b)=0, b=0] [L18] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 16 SDslu, 122 SDs, 0 SdLazy, 80 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 2 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 3/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...