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/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:06:20,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:06:20,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:06:20,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:06:20,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:06:20,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:06:20,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:06:20,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:06:20,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:06:20,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:06:20,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:06:20,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:06:20,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:06:20,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:06:20,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:06:20,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:06:20,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:06:20,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:06:20,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:06:20,141 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:06:20,142 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:06:20,143 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:06:20,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:06:20,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:06:20,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:06:20,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:06:20,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:06:20,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:06:20,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:06:20,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:06:20,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:06:20,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:06:20,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:06:20,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:06:20,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:06:20,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:06:20,154 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:06:20,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:06:20,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:06:20,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:06:20,181 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:06:20,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:06:20,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:06:20,182 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:06:20,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:06:20,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:06:20,182 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:06:20,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:06:20,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:06:20,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:06:20,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:06:20,183 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:06:20,184 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:06:20,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:06:20,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:06:20,184 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:06:20,185 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:06:20,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:06:20,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:06:20,185 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:06:20,185 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:06:20,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:06:20,189 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:06:20,189 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:06:20,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:06:20,190 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:06:20,190 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:06:20,190 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:06:20,190 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:06:20,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:06:20,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:06:20,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:06:20,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:06:20,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:06:20,263 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:06:20,264 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_1.i [2018-11-23 11:06:20,326 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b05849c/87d10fd61f3e4c93988b9affd8d64757/FLAG1297e3f8b [2018-11-23 11:06:20,754 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:06:20,755 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i [2018-11-23 11:06:20,761 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b05849c/87d10fd61f3e4c93988b9affd8d64757/FLAG1297e3f8b [2018-11-23 11:06:21,127 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b05849c/87d10fd61f3e4c93988b9affd8d64757 [2018-11-23 11:06:21,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:06:21,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:06:21,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:21,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:06:21,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:06:21,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f01937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21, skipping insertion in model container [2018-11-23 11:06:21,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:06:21,190 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:06:21,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:21,450 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:06:21,468 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:21,485 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:06:21,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21 WrapperNode [2018-11-23 11:06:21,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:21,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:21,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:06:21,487 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:06:21,497 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:06:21" (1/1) ... [2018-11-23 11:06:21,504 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:06:21" (1/1) ... [2018-11-23 11:06:21,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:21,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:06:21,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:06:21,512 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:06:21,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (1/1) ... [2018-11-23 11:06:21,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:06:21,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:06:21,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:06:21,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:06:21,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (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:06:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:06:21,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:06:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 11:06:21,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 11:06:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:06:21,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:06:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:06:21,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:06:22,048 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:06:22,049 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:06:22,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:22 BoogieIcfgContainer [2018-11-23 11:06:22,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:06:22,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:06:22,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:06:22,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:06:22,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:06:21" (1/3) ... [2018-11-23 11:06:22,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da9df7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:22, skipping insertion in model container [2018-11-23 11:06:22,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:21" (2/3) ... [2018-11-23 11:06:22,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da9df7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:22, skipping insertion in model container [2018-11-23 11:06:22,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:22" (3/3) ... [2018-11-23 11:06:22,058 INFO L112 eAbstractionObserver]: Analyzing ICFG test_while_int_true-termination.c_false-unreach-call_1.i [2018-11-23 11:06:22,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:06:22,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:06:22,092 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:06:22,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:06:22,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:06:22,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:06:22,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:06:22,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:06:22,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:06:22,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:06:22,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:06:22,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:06:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:06:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 11:06:22,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:22,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:22,158 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:22,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 676687463, now seen corresponding path program 1 times [2018-11-23 11:06:22,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:22,168 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:06:22,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:22,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:22,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:06:22,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:06:22,391 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #30#return; {20#true} is VALID [2018-11-23 11:06:22,392 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret1 := main(); {20#true} is VALID [2018-11-23 11:06:22,395 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~i~0 := 0bv32; {37#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:06:22,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {41#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:22,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(3bv32 != ~i~0); {21#false} is VALID [2018-11-23 11:06:22,399 INFO L256 TraceCheckUtils]: 7: Hoare triple {21#false} call __blast_assert(); {21#false} is VALID [2018-11-23 11:06:22,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:06:22,402 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:06:22,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:22,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:22,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:06:22,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 11:06:22,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:22,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:06:22,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:22,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:06:22,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:06:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:06:22,465 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2018-11-23 11:06:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:22,890 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2018-11-23 11:06:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:06:22,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-11-23 11:06:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:06:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 11:06:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:06:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-23 11:06:22,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-23 11:06:23,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:23,026 INFO L225 Difference]: With dead ends: 30 [2018-11-23 11:06:23,026 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 11:06:23,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:06:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 11:06:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-23 11:06:23,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:23,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 12 states. [2018-11-23 11:06:23,093 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 12 states. [2018-11-23 11:06:23,093 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 12 states. [2018-11-23 11:06:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:23,096 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:06:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:06:23,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:23,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:23,096 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states. [2018-11-23 11:06:23,097 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states. [2018-11-23 11:06:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:23,099 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 11:06:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:06:23,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:23,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:23,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:23,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:06:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:06:23,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-11-23 11:06:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:23,105 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:06:23,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:06:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:06:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:06:23,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:23,106 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:23,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:23,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1754257002, now seen corresponding path program 1 times [2018-11-23 11:06:23,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:23,107 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:06:23,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:23,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:23,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-23 11:06:23,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-23 11:06:23,335 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #30#return; {138#true} is VALID [2018-11-23 11:06:23,335 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret1 := main(); {138#true} is VALID [2018-11-23 11:06:23,339 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} ~i~0 := 0bv32; {155#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:06:23,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {155#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {159#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:23,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {159#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume 3bv32 != ~i~0; {159#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:23,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {159#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {166#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:06:23,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {166#(= (_ bv2 32) main_~i~0)} assume !(3bv32 != ~i~0); {139#false} is VALID [2018-11-23 11:06:23,343 INFO L256 TraceCheckUtils]: 9: Hoare triple {139#false} call __blast_assert(); {139#false} is VALID [2018-11-23 11:06:23,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-23 11:06:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:23,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:23,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {139#false} assume !false; {139#false} is VALID [2018-11-23 11:06:23,473 INFO L256 TraceCheckUtils]: 9: Hoare triple {139#false} call __blast_assert(); {139#false} is VALID [2018-11-23 11:06:23,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {182#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(3bv32 != ~i~0); {139#false} is VALID [2018-11-23 11:06:23,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {186#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {182#(not (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {186#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume 3bv32 != ~i~0; {186#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {186#(not (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,484 INFO L273 TraceCheckUtils]: 4: Hoare triple {138#true} ~i~0 := 0bv32; {193#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,485 INFO L256 TraceCheckUtils]: 3: Hoare triple {138#true} call #t~ret1 := main(); {138#true} is VALID [2018-11-23 11:06:23,485 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} #30#return; {138#true} is VALID [2018-11-23 11:06:23,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {138#true} assume true; {138#true} is VALID [2018-11-23 11:06:23,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {138#true} call ULTIMATE.init(); {138#true} is VALID [2018-11-23 11:06:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:23,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:23,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:06:23,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-11-23 11:06:23,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:23,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:06:23,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:23,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:06:23,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:06:23,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:06:23,595 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-11-23 11:06:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:24,395 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:06:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:06:24,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-11-23 11:06:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 11:06:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 11:06:24,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2018-11-23 11:06:24,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:24,445 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:06:24,446 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:06:24,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:06:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:06:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:06:24,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:24,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:06:24,500 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:06:24,501 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:06:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:24,503 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:06:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:06:24,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:24,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:24,504 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:06:24,504 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:06:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:24,507 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:06:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:06:24,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:24,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:24,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:24,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:06:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:06:24,511 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 11 [2018-11-23 11:06:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:24,511 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:06:24,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:06:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:06:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:06:24,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:24,512 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:24,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:24,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2083501651, now seen corresponding path program 2 times [2018-11-23 11:06:24,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:24,514 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:06:24,543 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:06:24,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:06:24,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 11:06:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:06:24,596 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #30#return; [?] CALL call #t~ret1 := main(); [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv1 32)] [?] assume 3bv32 != ~i~0; VAL [main_~i~0=(_ bv1 32)] [?] assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv2 32)] [?] assume 3bv32 != ~i~0; VAL [main_~i~0=(_ bv2 32)] [?] assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv3 32)] [?] assume !(3bv32 != ~i~0); VAL [main_~i~0=(_ bv3 32)] [?] CALL call __blast_assert(); [?] assume !false; [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=1bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=2bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] assume !(3bv32 != ~i~0); VAL [~i~0=3bv32] [L16] 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(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=1bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=2bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] assume !(3bv32 != ~i~0); VAL [~i~0=3bv32] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] 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(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] 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(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] CALL call __blast_assert(); [L6] assert false; [L12] int i=0; VAL [i=0] [L13] COND TRUE i<5 [L14] i++ VAL [i=1] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=1] [L13] COND TRUE i<5 [L14] i++ VAL [i=2] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=2] [L13] COND TRUE i<5 [L14] i++ VAL [i=3] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=3] [L16] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 11:06:24,667 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:06:24,667 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 11:06:24,667 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 11:06:24,667 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:06:24,668 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:06:24,668 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:06:24,668 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:06:24,668 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:06:24,668 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:06:24,669 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:06:24,669 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 11:06:24,669 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 11:06:24,669 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-23 11:06:24,669 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:06:24,669 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:06:24,670 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:06:24,671 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:06:24,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:06:24 BoogieIcfgContainer [2018-11-23 11:06:24,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:06:24,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:06:24,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:06:24,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:06:24,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:22" (3/4) ... [2018-11-23 11:06:24,678 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 #30#return; [?] CALL call #t~ret1 := main(); [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32)] [?] assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv1 32)] [?] assume 3bv32 != ~i~0; VAL [main_~i~0=(_ bv1 32)] [?] assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv2 32)] [?] assume 3bv32 != ~i~0; VAL [main_~i~0=(_ bv2 32)] [?] assume !!~bvslt32(~i~0, 5bv32);#t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; VAL [main_~i~0=(_ bv3 32)] [?] assume !(3bv32 != ~i~0); VAL [main_~i~0=(_ bv3 32)] [?] CALL call __blast_assert(); [?] assume !false; [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=1bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=2bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] assume !(3bv32 != ~i~0); VAL [~i~0=3bv32] [L16] 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(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=1bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] assume 3bv32 != ~i~0; VAL [~i~0=2bv32] [L13-L20] assume !!~bvslt32(~i~0, 5bv32); [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] assume !(3bv32 != ~i~0); VAL [~i~0=3bv32] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] 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(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] CALL call __blast_assert(); [L6] assert false; [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] 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(); [L12] ~i~0 := 0bv32; VAL [~i~0=0bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=1bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=1bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=2bv32] [L16] COND TRUE 3bv32 != ~i~0 VAL [~i~0=2bv32] [L13-L20] COND FALSE !(!~bvslt32(~i~0, 5bv32)) [L14] #t~post0 := ~i~0; [L14] ~i~0 := ~bvadd32(1bv32, #t~post0); [L14] havoc #t~post0; VAL [~i~0=3bv32] [L16] COND FALSE !(3bv32 != ~i~0) VAL [~i~0=3bv32] [L16] CALL call __blast_assert(); [L6] assert false; [L12] int i=0; VAL [i=0] [L13] COND TRUE i<5 [L14] i++ VAL [i=1] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=1] [L13] COND TRUE i<5 [L14] i++ VAL [i=2] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=2] [L13] COND TRUE i<5 [L14] i++ VAL [i=3] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=3] [L16] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 11:06:24,738 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test_while_int_true-termination.c_false-unreach-call_1.i-witness.graphml [2018-11-23 11:06:24,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:06:24,740 INFO L168 Benchmark]: Toolchain (without parser) took 3601.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -641.0 MB). Peak memory consumption was 89.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:24,742 INFO L168 Benchmark]: CDTParser took 0.21 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 11:06:24,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.71 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:06:24,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.83 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:06:24,744 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 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:06:24,745 INFO L168 Benchmark]: RCFGBuilder took 512.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:24,746 INFO L168 Benchmark]: TraceAbstraction took 2623.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.8 MB). Peak memory consumption was 132.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:24,747 INFO L168 Benchmark]: Witness Printer took 64.04 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:24,752 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.21 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 345.71 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 24.83 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 24.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 512.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2623.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 132.8 MB). Peak memory consumption was 132.8 MB. Max. memory is 7.1 GB. * Witness Printer took 64.04 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 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: [L12] int i=0; VAL [i=0] [L13] COND TRUE i<5 [L14] i++ VAL [i=1] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=1] [L13] COND TRUE i<5 [L14] i++ VAL [i=2] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=2] [L13] COND TRUE i<5 [L14] i++ VAL [i=3] [L16] (i!=3) ? (0) : __blast_assert () VAL [i=3] [L16] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. UNSAFE Result, 2.5s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 9 SDslu, 38 SDs, 0 SdLazy, 35 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 632 SizeOfPredicates, 2 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...