java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/terminator_03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:26,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:26,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:26,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:26,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:26,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:26,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:26,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:26,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:26,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:26,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:26,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:26,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:26,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:26,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:26,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:26,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:26,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:26,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:26,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:26,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:26,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:26,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:26,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:26,156 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:26,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:26,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:26,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:26,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:26,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:26,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:26,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:26,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:26,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:26,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:26,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:26,168 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:24:26,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:26,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:26,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:26,198 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:26,199 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:26,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:26,199 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:26,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:26,199 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:26,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:26,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:26,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:26,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:26,205 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:26,205 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:26,205 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:26,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:26,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:26,206 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:26,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:26,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:26,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:26,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:26,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:26,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:26,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:26,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:26,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:26,209 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:26,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:26,210 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:26,210 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:26,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:26,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:26,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:26,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:26,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:26,285 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:26,286 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/terminator_03_false-unreach-call_true-termination.i [2018-11-23 11:24:26,349 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e1f3608/3058eba2e9604a06a82e978c26db73a7/FLAG9b971ae99 [2018-11-23 11:24:26,825 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:26,825 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/terminator_03_false-unreach-call_true-termination.i [2018-11-23 11:24:26,832 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e1f3608/3058eba2e9604a06a82e978c26db73a7/FLAG9b971ae99 [2018-11-23 11:24:27,160 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e1f3608/3058eba2e9604a06a82e978c26db73a7 [2018-11-23 11:24:27,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:27,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:27,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:27,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:27,175 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:27,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519e8533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27, skipping insertion in model container [2018-11-23 11:24:27,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:27,209 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:27,453 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:27,458 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:27,477 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:27,497 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:27,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27 WrapperNode [2018-11-23 11:24:27,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:27,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:27,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:27,499 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:27,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:27,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:27,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:27,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:27,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... [2018-11-23 11:24:27,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:27,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:27,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:27,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:27,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:27,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:27,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:27,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:27,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:28,159 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:28,159 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:24:28,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:28 BoogieIcfgContainer [2018-11-23 11:24:28,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:28,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:28,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:28,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:28,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:27" (1/3) ... [2018-11-23 11:24:28,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3737920c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:28, skipping insertion in model container [2018-11-23 11:24:28,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:27" (2/3) ... [2018-11-23 11:24:28,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3737920c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:28, skipping insertion in model container [2018-11-23 11:24:28,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:28" (3/3) ... [2018-11-23 11:24:28,168 INFO L112 eAbstractionObserver]: Analyzing ICFG terminator_03_false-unreach-call_true-termination.i [2018-11-23 11:24:28,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:28,187 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:28,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:28,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:28,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:28,237 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:28,237 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:28,237 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:28,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:28,238 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:28,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:28,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:24:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:24:28,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:28,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:28,268 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:28,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2018-11-23 11:24:28,279 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:28,280 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:28,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:28,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:28,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:24:28,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:24:28,565 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #38#return; {22#true} is VALID [2018-11-23 11:24:28,566 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 11:24:28,566 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1; {22#true} is VALID [2018-11-23 11:24:28,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !~bvsgt32(~y~0, 0bv32); {42#(not (bvsgt main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:24:28,584 INFO L256 TraceCheckUtils]: 6: Hoare triple {42#(not (bvsgt main_~y~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); {46#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:28,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {50#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:24:28,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {50#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:24:28,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:24:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:28,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:28,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:28,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:24:28,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:24:28,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:28,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:24:28,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:28,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:24:28,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:24:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:24:28,707 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-11-23 11:24:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:29,413 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 11:24:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:24:29,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:24:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 11:24:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:24:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 11:24:29,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-23 11:24:29,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:29,627 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:24:29,627 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:24:29,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:24:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:24:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:24:29,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:29,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:29,670 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:29,670 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:29,674 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:24:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:24:29,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:29,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:29,675 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:29,675 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:24:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:29,677 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:24:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:24:29,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:29,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:29,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:29,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:24:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:24:29,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:24:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:29,682 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:24:29,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:24:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:24:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:24:29,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:29,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:29,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:29,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1117320769, now seen corresponding path program 1 times [2018-11-23 11:24:29,684 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:29,684 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:29,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:29,782 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret2 := main(); [?] ~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=(_ bv100 32), main_~y~0=(_ bv1073741824 32)] [?] assume ~bvsgt32(~y~0, 0bv32); VAL [main_~x~0=(_ bv100 32), main_~y~0=(_ bv1073741824 32)] [?] assume !~bvslt32(~x~0, 100bv32); VAL [main_~x~0=(_ bv100 32), main_~y~0=(_ bv1073741824 32)] [?] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16-L22] assume ~bvsgt32(~y~0, 0bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] assume !~bvslt32(~x~0, 100bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16-L22] assume ~bvsgt32(~y~0, 0bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] assume !~bvslt32(~x~0, 100bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1073741824] [L18] COND FALSE !(x<100) VAL [x=100, y=1073741824] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:24:29,820 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:24:29,820 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:29,820 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:24:29,820 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:24:29,820 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 11:24:29,820 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:24:29,821 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:29,821 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:24:29,821 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:24:29,821 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:24:29,821 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:29,821 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:24:29,822 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:24:29,822 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:24:29,822 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:24:29,822 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:24:29,822 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 11:24:29,822 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-23 11:24:29,823 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:24:29,823 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:24:29,823 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:24:29,823 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:24:29,823 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:24:29,823 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:24:29,824 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:24:29,826 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:24:29,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:24:29 BoogieIcfgContainer [2018-11-23 11:24:29,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:24:29,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:24:29,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:24:29,832 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:24:29,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:28" (3/4) ... [2018-11-23 11:24:29,836 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 #38#return; [?] CALL call #t~ret2 := main(); [?] ~x~0 := #t~nondet0;havoc #t~nondet0;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=(_ bv100 32), main_~y~0=(_ bv1073741824 32)] [?] assume ~bvsgt32(~y~0, 0bv32); VAL [main_~x~0=(_ bv100 32), main_~y~0=(_ bv1073741824 32)] [?] assume !~bvslt32(~x~0, 100bv32); VAL [main_~x~0=(_ bv100 32), main_~y~0=(_ bv1073741824 32)] [?] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16-L22] assume ~bvsgt32(~y~0, 0bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] assume !~bvslt32(~x~0, 100bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16-L22] assume ~bvsgt32(~y~0, 0bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] assume !~bvslt32(~x~0, 100bv32); VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L13] ~x~0 := #t~nondet0; [L13] havoc #t~nondet0; [L14] ~y~0 := #t~nondet1; [L14] havoc #t~nondet1; VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L16] COND TRUE ~bvsgt32(~y~0, 0bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L18-L21] COND TRUE !~bvslt32(~x~0, 100bv32) VAL [~x~0=100bv32, ~y~0=1073741824bv32] [L23] CALL call __VERIFIER_assert((if ~bvsle32(~y~0, 0bv32) || (~bvslt32(~y~0, 0bv32) && ~bvsge32(~x~0, 100bv32)) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1073741824] [L18] COND FALSE !(x<100) VAL [x=100, y=1073741824] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 11:24:29,887 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/terminator_03_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:24:29,887 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:24:29,889 INFO L168 Benchmark]: Toolchain (without parser) took 2719.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -704.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:29,891 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:24:29,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:29,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:24:29,892 INFO L168 Benchmark]: Boogie Preprocessor took 28.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:24:29,893 INFO L168 Benchmark]: RCFGBuilder took 607.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:29,894 INFO L168 Benchmark]: TraceAbstraction took 1669.70 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: 82.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:24:29,895 INFO L168 Benchmark]: Witness Printer took 56.48 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:24:29,899 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 326.67 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 25.33 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 28.58 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 607.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1669.70 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: 82.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. * Witness Printer took 56.48 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: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int x=__VERIFIER_nondet_int(); [L14] int y=__VERIFIER_nondet_int(); [L16] COND TRUE y>0 VAL [x=100, y=1073741824] [L18] COND FALSE !(x<100) VAL [x=100, y=1073741824] [L23] CALL __VERIFIER_assert(y<=0 || (y<0 && x>=100)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 1.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 7 SDslu, 49 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 2 NumberOfNonLiveVariables, 19 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...