java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:25,179 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:25,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:25,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:25,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:25,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:25,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:25,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:25,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:25,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:25,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:25,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:25,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:25,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:25,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:25,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:25,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:25,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:25,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:25,212 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:25,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:25,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:25,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:25,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:25,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:25,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:25,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:25,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:25,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:25,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:25,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:25,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:25,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:25,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:25,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:25,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:25,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:12:25,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:25,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:25,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:25,248 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:25,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:25,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:25,250 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:25,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:25,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:25,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:25,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:25,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:25,251 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:25,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:25,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:25,253 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:25,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:25,253 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:25,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:25,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:25,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:25,254 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:25,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:25,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:25,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:25,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:25,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:25,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:25,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:25,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:25,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:25,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:25,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:25,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:25,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:25,346 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:25,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i [2018-11-23 13:12:25,405 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84c9fe2d3/cc8f76ee5e7345ba90fa7f48c70c9c96/FLAGe2d535def [2018-11-23 13:12:25,848 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:25,849 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b_true-unreach-call_true-termination.c.i [2018-11-23 13:12:25,855 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84c9fe2d3/cc8f76ee5e7345ba90fa7f48c70c9c96/FLAGe2d535def [2018-11-23 13:12:26,242 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84c9fe2d3/cc8f76ee5e7345ba90fa7f48c70c9c96 [2018-11-23 13:12:26,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:26,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:26,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:26,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:26,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:26,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14652b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26, skipping insertion in model container [2018-11-23 13:12:26,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:26,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:26,524 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:26,528 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:26,548 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:26,566 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:26,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26 WrapperNode [2018-11-23 13:12:26,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:26,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:26,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:26,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:26,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:26,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:26,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:26,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:26,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (1/1) ... [2018-11-23 13:12:26,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:26,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:26,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:26,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:26,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (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 13:12:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:27,182 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:27,182 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:27,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:27 BoogieIcfgContainer [2018-11-23 13:12:27,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:27,184 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:27,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:27,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:27,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:26" (1/3) ... [2018-11-23 13:12:27,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7359472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:27, skipping insertion in model container [2018-11-23 13:12:27,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:26" (2/3) ... [2018-11-23 13:12:27,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7359472d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:27, skipping insertion in model container [2018-11-23 13:12:27,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:27" (3/3) ... [2018-11-23 13:12:27,194 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007b_true-unreach-call_true-termination.c.i [2018-11-23 13:12:27,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:27,219 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:27,234 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:27,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:27,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:27,265 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:27,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:27,265 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:27,265 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:27,266 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:27,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:27,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:12:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:27,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:27,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:27,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:27,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2009018560, now seen corresponding path program 1 times [2018-11-23 13:12:27,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:27,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:27,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:27,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:12:27,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:12:27,429 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #40#return; {24#true} is VALID [2018-11-23 13:12:27,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-23 13:12:27,430 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 13:12:27,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:12:27,444 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {25#false} is VALID [2018-11-23 13:12:27,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:12:27,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:12:27,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:12:27,448 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 13:12:27,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:27,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:27,457 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:27,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:27,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:27,513 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 13:12:27,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:27,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:27,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:27,523 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:12:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,603 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 13:12:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:27,604 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2018-11-23 13:12:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2018-11-23 13:12:27,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2018-11-23 13:12:27,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:27,978 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:12:27,979 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:12:28,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:28,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:28,028 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:28,028 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:28,032 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:28,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:28,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:28,034 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:28,034 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:28,037 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:28,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:28,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:28,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:28,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 13:12:28,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 13:12:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:28,043 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 13:12:28,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:28,043 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:28,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:28,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:28,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:28,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:28,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2019177291, now seen corresponding path program 1 times [2018-11-23 13:12:28,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:28,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:28,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:28,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2018-11-23 13:12:28,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2018-11-23 13:12:28,214 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #40#return; {129#true} is VALID [2018-11-23 13:12:28,215 INFO L256 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret3 := main(); {129#true} is VALID [2018-11-23 13:12:28,216 INFO L273 TraceCheckUtils]: 4: Hoare triple {129#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {131#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:28,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {131#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:28,220 INFO L256 TraceCheckUtils]: 6: Hoare triple {131#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {132#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:12:28,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {132#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {133#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:28,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {133#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2018-11-23 13:12:28,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2018-11-23 13:12:28,231 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 13:12:28,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:28,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:28,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:12:28,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:28,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:12:28,285 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 13:12:28,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:12:28,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:28,286 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-11-23 13:12:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:28,625 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 13:12:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:28,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:12:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 13:12:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 13:12:28,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-23 13:12:28,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:28,808 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:12:28,808 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:12:28,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 13:12:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:12:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 13:12:28,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:28,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 13:12:28,997 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 13:12:28,997 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 13:12:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:29,000 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:12:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:12:29,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:29,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:29,001 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 13:12:29,002 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 13:12:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:29,005 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:12:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:12:29,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:29,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:29,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:29,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:12:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 13:12:29,009 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2018-11-23 13:12:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:29,009 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 13:12:29,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:12:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 13:12:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:12:29,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:29,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:29,011 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:29,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1543015754, now seen corresponding path program 1 times [2018-11-23 13:12:29,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:29,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-23 13:12:29,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-23 13:12:29,146 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #40#return; {262#true} is VALID [2018-11-23 13:12:29,146 INFO L256 TraceCheckUtils]: 3: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2018-11-23 13:12:29,150 INFO L273 TraceCheckUtils]: 4: Hoare triple {262#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {264#(<= 0 main_~x~0)} is VALID [2018-11-23 13:12:29,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {264#(<= 0 main_~x~0)} is VALID [2018-11-23 13:12:29,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {264#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {265#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:29,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {265#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:29,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {265#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {265#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:29,159 INFO L256 TraceCheckUtils]: 9: Hoare triple {265#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {266#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:29,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {266#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {267#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:29,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {263#false} is VALID [2018-11-23 13:12:29,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-23 13:12:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:29,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:29,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:29,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:29,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:29,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-23 13:12:29,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-23 13:12:29,359 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #40#return; {262#true} is VALID [2018-11-23 13:12:29,359 INFO L256 TraceCheckUtils]: 3: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2018-11-23 13:12:29,360 INFO L273 TraceCheckUtils]: 4: Hoare triple {262#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {264#(<= 0 main_~x~0)} is VALID [2018-11-23 13:12:29,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {264#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {264#(<= 0 main_~x~0)} is VALID [2018-11-23 13:12:29,365 INFO L273 TraceCheckUtils]: 6: Hoare triple {264#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {265#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:29,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {265#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:29,366 INFO L273 TraceCheckUtils]: 8: Hoare triple {265#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {265#(<= 0 main_~m~0)} is VALID [2018-11-23 13:12:29,367 INFO L256 TraceCheckUtils]: 9: Hoare triple {265#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {266#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:29,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {266#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {267#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:29,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {263#false} is VALID [2018-11-23 13:12:29,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-23 13:12:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:29,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:12:29,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 13:12:29,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:29,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:29,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:29,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:29,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:29,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:29,411 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-11-23 13:12:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:29,890 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:12:29,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:29,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 13:12:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:12:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:12:29,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 13:12:29,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:29,934 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:12:29,935 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:12:29,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:12:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-11-23 13:12:29,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:29,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 18 states. [2018-11-23 13:12:29,954 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 18 states. [2018-11-23 13:12:29,955 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 18 states. [2018-11-23 13:12:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:29,959 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 13:12:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:12:29,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:29,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:29,960 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 26 states. [2018-11-23 13:12:29,960 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 26 states. [2018-11-23 13:12:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:29,967 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-23 13:12:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:12:29,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:29,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:29,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:29,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:12:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:12:29,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 13:12:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:29,976 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:12:29,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:12:29,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:12:29,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:29,977 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:29,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:29,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash -595645528, now seen corresponding path program 1 times [2018-11-23 13:12:29,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:29,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:29,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,161 INFO L256 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {431#true} is VALID [2018-11-23 13:12:30,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {431#true} assume true; {431#true} is VALID [2018-11-23 13:12:30,162 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {431#true} {431#true} #40#return; {431#true} is VALID [2018-11-23 13:12:30,163 INFO L256 TraceCheckUtils]: 3: Hoare triple {431#true} call #t~ret3 := main(); {431#true} is VALID [2018-11-23 13:12:30,165 INFO L273 TraceCheckUtils]: 4: Hoare triple {431#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {433#(and (<= 0 main_~m~0) (<= main_~m~0 0))} is VALID [2018-11-23 13:12:30,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {433#(and (<= 0 main_~m~0) (<= main_~m~0 0))} assume !(~x~0 < ~n~0); {433#(and (<= 0 main_~m~0) (<= main_~m~0 0))} is VALID [2018-11-23 13:12:30,169 INFO L256 TraceCheckUtils]: 6: Hoare triple {433#(and (<= 0 main_~m~0) (<= main_~m~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {431#true} is VALID [2018-11-23 13:12:30,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#true} ~cond := #in~cond; {434#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:12:30,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:30,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:30,171 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {435#(not (= |__VERIFIER_assert_#in~cond| 0))} {433#(and (<= 0 main_~m~0) (<= main_~m~0 0))} #44#return; {436#(or (<= main_~n~0 0) (<= main_~m~0 0))} is VALID [2018-11-23 13:12:30,173 INFO L256 TraceCheckUtils]: 11: Hoare triple {436#(or (<= main_~n~0 0) (<= main_~m~0 0))} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:30,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {435#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {437#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:30,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {437#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {432#false} is VALID [2018-11-23 13:12:30,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {432#false} assume !false; {432#false} is VALID [2018-11-23 13:12:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:30,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:30,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {431#true} is VALID [2018-11-23 13:12:30,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {431#true} assume true; {431#true} is VALID [2018-11-23 13:12:30,340 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {431#true} {431#true} #40#return; {431#true} is VALID [2018-11-23 13:12:30,340 INFO L256 TraceCheckUtils]: 3: Hoare triple {431#true} call #t~ret3 := main(); {431#true} is VALID [2018-11-23 13:12:30,342 INFO L273 TraceCheckUtils]: 4: Hoare triple {431#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {453#(<= main_~x~0 0)} is VALID [2018-11-23 13:12:30,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {453#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {457#(<= main_~n~0 0)} is VALID [2018-11-23 13:12:30,344 INFO L256 TraceCheckUtils]: 6: Hoare triple {457#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {431#true} is VALID [2018-11-23 13:12:30,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2018-11-23 13:12:30,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2018-11-23 13:12:30,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {431#true} assume true; {431#true} is VALID [2018-11-23 13:12:30,353 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {431#true} {457#(<= main_~n~0 0)} #44#return; {457#(<= main_~n~0 0)} is VALID [2018-11-23 13:12:30,356 INFO L256 TraceCheckUtils]: 11: Hoare triple {457#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {476#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:30,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {480#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:30,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {480#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {432#false} is VALID [2018-11-23 13:12:30,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {432#false} assume !false; {432#false} is VALID [2018-11-23 13:12:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:30,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:12:30,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-11-23 13:12:30,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-11-23 13:12:30,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:30,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:12:30,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:30,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:12:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:12:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:12:30,431 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 11 states. [2018-11-23 13:12:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,166 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 13:12:31,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:12:31,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2018-11-23 13:12:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:12:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-11-23 13:12:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:12:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-11-23 13:12:31,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 48 transitions. [2018-11-23 13:12:31,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:31,309 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:12:31,310 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:12:31,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:12:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:12:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-11-23 13:12:31,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:31,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 23 states. [2018-11-23 13:12:31,364 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 23 states. [2018-11-23 13:12:31,364 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 23 states. [2018-11-23 13:12:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,367 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:12:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:12:31,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:31,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:31,368 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 28 states. [2018-11-23 13:12:31,368 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 28 states. [2018-11-23 13:12:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,371 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:12:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:12:31,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:31,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:31,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:31,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:12:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 13:12:31,374 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2018-11-23 13:12:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:31,374 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 13:12:31,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:12:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:12:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:12:31,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:31,376 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:31,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:31,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1165348024, now seen corresponding path program 1 times [2018-11-23 13:12:31,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:31,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {648#true} is VALID [2018-11-23 13:12:31,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 13:12:31,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {648#true} {648#true} #40#return; {648#true} is VALID [2018-11-23 13:12:31,485 INFO L256 TraceCheckUtils]: 3: Hoare triple {648#true} call #t~ret3 := main(); {648#true} is VALID [2018-11-23 13:12:31,485 INFO L273 TraceCheckUtils]: 4: Hoare triple {648#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {648#true} is VALID [2018-11-23 13:12:31,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {648#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {648#true} is VALID [2018-11-23 13:12:31,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {648#true} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {648#true} is VALID [2018-11-23 13:12:31,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {648#true} ~x~0 := 1 + ~x~0; {648#true} is VALID [2018-11-23 13:12:31,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {648#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {650#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2018-11-23 13:12:31,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {650#(<= (+ main_~x~0 1) main_~n~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {651#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-23 13:12:31,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {651#(<= (+ main_~m~0 1) main_~n~0)} ~x~0 := 1 + ~x~0; {651#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-23 13:12:31,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {651#(<= (+ main_~m~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {651#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-23 13:12:31,494 INFO L256 TraceCheckUtils]: 12: Hoare triple {651#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {648#true} is VALID [2018-11-23 13:12:31,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#true} ~cond := #in~cond; {648#true} is VALID [2018-11-23 13:12:31,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {648#true} assume !(0 == ~cond); {648#true} is VALID [2018-11-23 13:12:31,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {648#true} assume true; {648#true} is VALID [2018-11-23 13:12:31,496 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {648#true} {651#(<= (+ main_~m~0 1) main_~n~0)} #44#return; {651#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2018-11-23 13:12:31,499 INFO L256 TraceCheckUtils]: 17: Hoare triple {651#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {652#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:31,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {653#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:31,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {653#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {649#false} is VALID [2018-11-23 13:12:31,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#false} assume !false; {649#false} is VALID [2018-11-23 13:12:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:31,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:12:31,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:12:31,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:31,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:31,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:31,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:31,534 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-11-23 13:12:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,749 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 13:12:31,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:31,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:12:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 13:12:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-11-23 13:12:31,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2018-11-23 13:12:31,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:31,791 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:12:31,791 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:31,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:31,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:31,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:31,793 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:31,793 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,794 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:31,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:31,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:31,794 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:31,794 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,795 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:31,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:31,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:31,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:31,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:31,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 13:12:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:31,796 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:31,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:31,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:31,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:31,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 13:12:32,050 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:32,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:32,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:32,051 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:32,051 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:32,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:32,051 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-23 13:12:32,051 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-23 13:12:32,051 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 13:12:32,052 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and (<= main_~n~0 0) .cse0 .cse1) (and .cse0 (<= (+ main_~m~0 1) main_~n~0) .cse1))) [2018-11-23 13:12:32,052 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-11-23 13:12:32,052 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 17) no Hoare annotation was computed. [2018-11-23 13:12:32,052 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-23 13:12:32,052 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 19) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and (<= main_~n~0 0) .cse0 .cse1) (and .cse0 (<= (+ main_~m~0 1) main_~n~0) .cse1))) [2018-11-23 13:12:32,052 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 19) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0)) (.cse1 (<= 0 main_~x~0))) (or (and (<= main_~n~0 0) .cse0 .cse1) (and .cse0 (<= (+ main_~m~0 1) main_~n~0) .cse1))) [2018-11-23 13:12:32,052 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:32,053 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:32,053 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:32,053 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:32,053 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:32,053 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:32,055 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:32,056 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:32,056 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:32,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:32,057 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:32,058 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:32,058 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:32,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:32 BoogieIcfgContainer [2018-11-23 13:12:32,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:32,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:32,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:32,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:32,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:27" (3/4) ... [2018-11-23 13:12:32,073 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:32,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:32,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:32,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:32,084 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:12:32,084 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:12:32,084 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:32,132 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/gj2007b_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:32,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:32,133 INFO L168 Benchmark]: Toolchain (without parser) took 5881.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -405.1 MB). Peak memory consumption was 300.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,135 INFO L168 Benchmark]: CDTParser took 0.20 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 13:12:32,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.78 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 13:12:32,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.71 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 13:12:32,137 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 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 13:12:32,138 INFO L168 Benchmark]: RCFGBuilder took 575.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,139 INFO L168 Benchmark]: TraceAbstraction took 4884.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 339.7 MB). Peak memory consumption was 339.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:32,140 INFO L168 Benchmark]: Witness Printer took 63.30 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:32,145 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.20 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 308.78 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 18.71 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 21.56 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 575.35 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4884.13 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 339.7 MB). Peak memory consumption was 339.7 MB. Max. memory is 7.1 GB. * Witness Printer took 63.30 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((n <= 0 && 0 <= m) && 0 <= x) || ((0 <= m && m + 1 <= n) && 0 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 4.7s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 48 SDslu, 189 SDs, 0 SdLazy, 169 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 28 NumberOfFragments, 74 HoareAnnotationTreeSize, 17 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 47 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2718 SizeOfPredicates, 6 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...