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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:07:00,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:07:00,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:07:00,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:07:00,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:07:00,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:07:00,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:07:00,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:07:00,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:07:00,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:07:00,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:07:00,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:07:00,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:07:00,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:07:00,216 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:07:00,216 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:07:00,217 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:07:00,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:07:00,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:07:00,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:07:00,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:07:00,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:07:00,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:07:00,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:07:00,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:07:00,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:07:00,245 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:07:00,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:07:00,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:07:00,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:07:00,250 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:07:00,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:07:00,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:07:00,252 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:07:00,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:07:00,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:07:00,258 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-19 00:07:00,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:07:00,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:07:00,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:07:00,288 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:07:00,288 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:07:00,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:07:00,289 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:07:00,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:07:00,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:07:00,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:07:00,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:07:00,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:07:00,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:07:00,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:07:00,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:07:00,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:07:00,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:07:00,291 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:07:00,291 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:07:00,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:07:00,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:07:00,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:07:00,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:07:00,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:07:00,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:07:00,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:07:00,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:07:00,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:07:00,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:07:00,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:07:00,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:07:00,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:07:00,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:07:00,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:07:00,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:07:00,389 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:07:00,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i [2018-11-19 00:07:00,457 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265325955/20ce824ef35a4fa2ab68ce5406eb5c46/FLAG37167ea71 [2018-11-19 00:07:00,924 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:07:00,926 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i [2018-11-19 00:07:00,933 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265325955/20ce824ef35a4fa2ab68ce5406eb5c46/FLAG37167ea71 [2018-11-19 00:07:01,292 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265325955/20ce824ef35a4fa2ab68ce5406eb5c46 [2018-11-19 00:07:01,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:07:01,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:07:01,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:07:01,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:07:01,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:07:01,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fad2b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01, skipping insertion in model container [2018-11-19 00:07:01,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:07:01,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:07:01,525 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:07:01,532 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:07:01,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:07:01,569 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:07:01,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01 WrapperNode [2018-11-19 00:07:01,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:07:01,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:07:01,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:07:01,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:07:01,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (1/1) ... [2018-11-19 00:07:01,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:07:01,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:07:01,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:07:01,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:07:01,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (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-19 00:07:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:07:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:07:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-19 00:07:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:07:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:07:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-19 00:07:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:07:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 00:07:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:07:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:07:01,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:07:02,205 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:07:02,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:07:02 BoogieIcfgContainer [2018-11-19 00:07:02,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:07:02,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:07:02,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:07:02,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:07:02,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:07:01" (1/3) ... [2018-11-19 00:07:02,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c29c3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:07:02, skipping insertion in model container [2018-11-19 00:07:02,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:01" (2/3) ... [2018-11-19 00:07:02,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c29c3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:07:02, skipping insertion in model container [2018-11-19 00:07:02,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:07:02" (3/3) ... [2018-11-19 00:07:02,215 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005b_true-unreach-call_true-termination.c.i [2018-11-19 00:07:02,225 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:07:02,234 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:07:02,251 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:07:02,288 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:07:02,289 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:07:02,290 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:07:02,290 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:07:02,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:07:02,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:07:02,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:07:02,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:07:02,291 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:07:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-19 00:07:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-19 00:07:02,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:02,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:02,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:02,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash -557638975, now seen corresponding path program 1 times [2018-11-19 00:07:02,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:02,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:02,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-19 00:07:02,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-19 00:07:02,468 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-19 00:07:02,469 INFO L256 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2018-11-19 00:07:02,469 INFO L273 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {27#true} is VALID [2018-11-19 00:07:02,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-19 00:07:02,483 INFO L256 TraceCheckUtils]: 6: Hoare triple {28#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {28#false} is VALID [2018-11-19 00:07:02,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-19 00:07:02,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-19 00:07:02,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-19 00:07:02,488 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-19 00:07:02,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:02,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 00:07:02,497 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-19 00:07:02,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:02,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-19 00:07:02,542 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-19 00:07:02,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-19 00:07:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 00:07:02,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 00:07:02,554 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-19 00:07:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:02,661 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2018-11-19 00:07:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 00:07:02,661 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-19 00:07:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:07:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-19 00:07:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:07:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-19 00:07:02,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-19 00:07:03,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:03,112 INFO L225 Difference]: With dead ends: 43 [2018-11-19 00:07:03,113 INFO L226 Difference]: Without dead ends: 17 [2018-11-19 00:07:03,116 INFO L604 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-19 00:07:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-19 00:07:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-19 00:07:03,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:03,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-19 00:07:03,167 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-19 00:07:03,167 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-19 00:07:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,171 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-19 00:07:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-19 00:07:03,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,172 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-19 00:07:03,172 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-19 00:07:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,177 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-19 00:07:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-19 00:07:03,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:03,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:07:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-19 00:07:03,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-11-19 00:07:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:03,185 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-19 00:07:03,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 00:07:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-19 00:07:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-19 00:07:03,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:03,187 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:03,188 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:03,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1155614924, now seen corresponding path program 1 times [2018-11-19 00:07:03,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:03,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:03,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:03,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:03,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-19 00:07:03,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-19 00:07:03,264 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {148#true} {148#true} #60#return; {148#true} is VALID [2018-11-19 00:07:03,264 INFO L256 TraceCheckUtils]: 3: Hoare triple {148#true} call #t~ret1 := main(); {148#true} is VALID [2018-11-19 00:07:03,283 INFO L273 TraceCheckUtils]: 4: Hoare triple {148#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {150#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:03,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {150#(<= main_~i~0 0)} assume true; {150#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:03,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {150#(<= main_~i~0 0)} assume !(~i~0 <= 100); {149#false} is VALID [2018-11-19 00:07:03,303 INFO L256 TraceCheckUtils]: 7: Hoare triple {149#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {149#false} is VALID [2018-11-19 00:07:03,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {149#false} ~cond := #in~cond; {149#false} is VALID [2018-11-19 00:07:03,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {149#false} assume 0 == ~cond; {149#false} is VALID [2018-11-19 00:07:03,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-19 00:07:03,305 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-19 00:07:03,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:03,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-19 00:07:03,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-19 00:07:03,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:03,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 00:07:03,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:03,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 00:07:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 00:07:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:07:03,356 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2018-11-19 00:07:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,546 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-19 00:07:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 00:07:03,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-19 00:07:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:07:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-19 00:07:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:07:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-11-19 00:07:03,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-11-19 00:07:03,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:03,604 INFO L225 Difference]: With dead ends: 24 [2018-11-19 00:07:03,604 INFO L226 Difference]: Without dead ends: 19 [2018-11-19 00:07:03,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:07:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-19 00:07:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-19 00:07:03,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:03,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-19 00:07:03,621 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-19 00:07:03,621 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-19 00:07:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,624 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-19 00:07:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-19 00:07:03,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,625 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-19 00:07:03,625 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-19 00:07:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,627 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-19 00:07:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-19 00:07:03,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:03,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:07:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-19 00:07:03,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2018-11-19 00:07:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:03,630 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-19 00:07:03,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 00:07:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-19 00:07:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-19 00:07:03,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:03,632 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:03,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:03,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -220474704, now seen corresponding path program 1 times [2018-11-19 00:07:03,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:03,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2018-11-19 00:07:03,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-19 00:07:03,716 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #60#return; {256#true} is VALID [2018-11-19 00:07:03,716 INFO L256 TraceCheckUtils]: 3: Hoare triple {256#true} call #t~ret1 := main(); {256#true} is VALID [2018-11-19 00:07:03,717 INFO L273 TraceCheckUtils]: 4: Hoare triple {256#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {258#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:03,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {258#(<= (+ main_~j~0 100) 0)} assume true; {258#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:03,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {258#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {258#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:03,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= (+ main_~j~0 100) 0)} assume true; {258#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:03,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {258#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {257#false} is VALID [2018-11-19 00:07:03,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {257#false} ~k~0 := 4; {257#false} is VALID [2018-11-19 00:07:03,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {257#false} assume true; {257#false} is VALID [2018-11-19 00:07:03,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {257#false} assume !(~k~0 <= 3); {257#false} is VALID [2018-11-19 00:07:03,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {257#false} assume true; {257#false} is VALID [2018-11-19 00:07:03,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#false} assume !(~i~0 <= 100); {257#false} is VALID [2018-11-19 00:07:03,723 INFO L256 TraceCheckUtils]: 14: Hoare triple {257#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {257#false} is VALID [2018-11-19 00:07:03,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2018-11-19 00:07:03,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2018-11-19 00:07:03,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2018-11-19 00:07:03,727 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-19 00:07:03,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:03,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-19 00:07:03,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-19 00:07:03,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:03,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 00:07:03,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:03,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 00:07:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 00:07:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:07:03,763 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-19 00:07:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:04,179 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-19 00:07:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 00:07:04,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-19 00:07:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:07:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-19 00:07:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:07:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-19 00:07:04,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-19 00:07:04,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:04,252 INFO L225 Difference]: With dead ends: 33 [2018-11-19 00:07:04,252 INFO L226 Difference]: Without dead ends: 21 [2018-11-19 00:07:04,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:07:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-19 00:07:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-19 00:07:04,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:04,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-19 00:07:04,275 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-19 00:07:04,276 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-19 00:07:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:04,278 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-19 00:07:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-19 00:07:04,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:04,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:04,279 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-19 00:07:04,279 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-19 00:07:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:04,282 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-19 00:07:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-19 00:07:04,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:04,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:04,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:04,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:07:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-19 00:07:04,285 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-11-19 00:07:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:04,285 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-19 00:07:04,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 00:07:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-19 00:07:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-19 00:07:04,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:04,287 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:04,287 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:04,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 260416874, now seen corresponding path program 1 times [2018-11-19 00:07:04,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:04,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-19 00:07:04,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-19 00:07:04,380 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {384#true} {384#true} #60#return; {384#true} is VALID [2018-11-19 00:07:04,380 INFO L256 TraceCheckUtils]: 3: Hoare triple {384#true} call #t~ret1 := main(); {384#true} is VALID [2018-11-19 00:07:04,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {384#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {386#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:04,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#(<= main_~i~0 0)} assume true; {386#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:04,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(<= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {387#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {387#(<= main_~i~0 1)} assume !(~j~0 < 20); {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {387#(<= main_~i~0 1)} ~k~0 := 4; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {387#(<= main_~i~0 1)} assume !(~k~0 <= 3); {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {387#(<= main_~i~0 1)} assume !(~i~0 <= 100); {385#false} is VALID [2018-11-19 00:07:04,414 INFO L256 TraceCheckUtils]: 16: Hoare triple {385#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {385#false} is VALID [2018-11-19 00:07:04,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-19 00:07:04,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2018-11-19 00:07:04,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-19 00:07:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-19 00:07:04,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:07:04,417 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-19 00:07:04,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:04,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:07:04,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {384#true} call ULTIMATE.init(); {384#true} is VALID [2018-11-19 00:07:04,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {384#true} assume true; {384#true} is VALID [2018-11-19 00:07:04,579 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {384#true} {384#true} #60#return; {384#true} is VALID [2018-11-19 00:07:04,579 INFO L256 TraceCheckUtils]: 3: Hoare triple {384#true} call #t~ret1 := main(); {384#true} is VALID [2018-11-19 00:07:04,582 INFO L273 TraceCheckUtils]: 4: Hoare triple {384#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {386#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:04,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {386#(<= main_~i~0 0)} assume true; {386#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:04,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(<= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {387#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {387#(<= main_~i~0 1)} assume !(~j~0 < 20); {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {387#(<= main_~i~0 1)} ~k~0 := 4; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {387#(<= main_~i~0 1)} assume !(~k~0 <= 3); {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {387#(<= main_~i~0 1)} assume true; {387#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:04,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {387#(<= main_~i~0 1)} assume !(~i~0 <= 100); {385#false} is VALID [2018-11-19 00:07:04,597 INFO L256 TraceCheckUtils]: 16: Hoare triple {385#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {385#false} is VALID [2018-11-19 00:07:04,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {385#false} ~cond := #in~cond; {385#false} is VALID [2018-11-19 00:07:04,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {385#false} assume 0 == ~cond; {385#false} is VALID [2018-11-19 00:07:04,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {385#false} assume !false; {385#false} is VALID [2018-11-19 00:07:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-19 00:07:04,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:07:04,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-19 00:07:04,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-19 00:07:04,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:04,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-19 00:07:04,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:04,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-19 00:07:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-19 00:07:04,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-19 00:07:04,652 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 4 states. [2018-11-19 00:07:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:04,986 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-19 00:07:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-19 00:07:04,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-19 00:07:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-19 00:07:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-11-19 00:07:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-19 00:07:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-11-19 00:07:04,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2018-11-19 00:07:05,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:05,059 INFO L225 Difference]: With dead ends: 33 [2018-11-19 00:07:05,059 INFO L226 Difference]: Without dead ends: 28 [2018-11-19 00:07:05,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-19 00:07:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-19 00:07:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-19 00:07:05,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:05,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-19 00:07:05,088 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-19 00:07:05,088 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-19 00:07:05,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:05,091 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-19 00:07:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-19 00:07:05,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:05,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:05,092 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-19 00:07:05,092 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-19 00:07:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:05,095 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-19 00:07:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-19 00:07:05,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:05,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:05,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:05,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-19 00:07:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-19 00:07:05,098 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-11-19 00:07:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:05,099 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-19 00:07:05,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-19 00:07:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-19 00:07:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-19 00:07:05,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:05,100 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:05,101 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:05,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1089248186, now seen corresponding path program 2 times [2018-11-19 00:07:05,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:05,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:05,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:05,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2018-11-19 00:07:05,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {594#true} assume true; {594#true} is VALID [2018-11-19 00:07:05,208 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {594#true} {594#true} #60#return; {594#true} is VALID [2018-11-19 00:07:05,209 INFO L256 TraceCheckUtils]: 3: Hoare triple {594#true} call #t~ret1 := main(); {594#true} is VALID [2018-11-19 00:07:05,210 INFO L273 TraceCheckUtils]: 4: Hoare triple {594#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {596#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:05,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {596#(<= (+ main_~j~0 100) 0)} assume true; {596#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:05,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {596#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {596#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:05,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {596#(<= (+ main_~j~0 100) 0)} assume true; {596#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:05,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {596#(<= (+ main_~j~0 100) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {597#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2018-11-19 00:07:05,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {597#(<= (+ main_~j~0 100) main_~i~0)} assume true; {597#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2018-11-19 00:07:05,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {597#(<= (+ main_~j~0 100) main_~i~0)} assume !(~j~0 < 20); {598#(<= 120 main_~i~0)} is VALID [2018-11-19 00:07:05,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {598#(<= 120 main_~i~0)} ~k~0 := 4; {598#(<= 120 main_~i~0)} is VALID [2018-11-19 00:07:05,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {598#(<= 120 main_~i~0)} assume true; {598#(<= 120 main_~i~0)} is VALID [2018-11-19 00:07:05,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {598#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {598#(<= 120 main_~i~0)} is VALID [2018-11-19 00:07:05,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {598#(<= 120 main_~i~0)} assume true; {598#(<= 120 main_~i~0)} is VALID [2018-11-19 00:07:05,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {598#(<= 120 main_~i~0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {595#false} is VALID [2018-11-19 00:07:05,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {595#false} assume !(~j~0 < 20); {595#false} is VALID [2018-11-19 00:07:05,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {595#false} ~k~0 := 4; {595#false} is VALID [2018-11-19 00:07:05,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {595#false} assume !(~k~0 <= 3); {595#false} is VALID [2018-11-19 00:07:05,243 INFO L273 TraceCheckUtils]: 21: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {595#false} assume !(~i~0 <= 100); {595#false} is VALID [2018-11-19 00:07:05,244 INFO L256 TraceCheckUtils]: 23: Hoare triple {595#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {595#false} is VALID [2018-11-19 00:07:05,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2018-11-19 00:07:05,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {595#false} assume 0 == ~cond; {595#false} is VALID [2018-11-19 00:07:05,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {595#false} assume !false; {595#false} is VALID [2018-11-19 00:07:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:07:05,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:07:05,247 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-19 00:07:05,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:07:05,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:07:05,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:07:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:05,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:07:05,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {594#true} call ULTIMATE.init(); {594#true} is VALID [2018-11-19 00:07:05,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {594#true} assume true; {594#true} is VALID [2018-11-19 00:07:05,476 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {594#true} {594#true} #60#return; {594#true} is VALID [2018-11-19 00:07:05,476 INFO L256 TraceCheckUtils]: 3: Hoare triple {594#true} call #t~ret1 := main(); {594#true} is VALID [2018-11-19 00:07:05,477 INFO L273 TraceCheckUtils]: 4: Hoare triple {594#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {596#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:05,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {596#(<= (+ main_~j~0 100) 0)} assume true; {596#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-19 00:07:05,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {596#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {620#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 101))} is VALID [2018-11-19 00:07:05,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 101))} assume true; {620#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 101))} is VALID [2018-11-19 00:07:05,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {620#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 101))} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {627#(<= main_~j~0 1)} is VALID [2018-11-19 00:07:05,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {627#(<= main_~j~0 1)} assume true; {627#(<= main_~j~0 1)} is VALID [2018-11-19 00:07:05,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(<= main_~j~0 1)} assume !(~j~0 < 20); {595#false} is VALID [2018-11-19 00:07:05,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#false} ~k~0 := 4; {595#false} is VALID [2018-11-19 00:07:05,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#false} assume !(~k~0 <= 3); {595#false} is VALID [2018-11-19 00:07:05,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {595#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {595#false} is VALID [2018-11-19 00:07:05,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {595#false} assume !(~j~0 < 20); {595#false} is VALID [2018-11-19 00:07:05,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {595#false} ~k~0 := 4; {595#false} is VALID [2018-11-19 00:07:05,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {595#false} assume !(~k~0 <= 3); {595#false} is VALID [2018-11-19 00:07:05,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {595#false} assume true; {595#false} is VALID [2018-11-19 00:07:05,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {595#false} assume !(~i~0 <= 100); {595#false} is VALID [2018-11-19 00:07:05,488 INFO L256 TraceCheckUtils]: 23: Hoare triple {595#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {595#false} is VALID [2018-11-19 00:07:05,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2018-11-19 00:07:05,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {595#false} assume 0 == ~cond; {595#false} is VALID [2018-11-19 00:07:05,489 INFO L273 TraceCheckUtils]: 26: Hoare triple {595#false} assume !false; {595#false} is VALID [2018-11-19 00:07:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-19 00:07:05,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:07:05,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-19 00:07:05,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-19 00:07:05,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:05,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-19 00:07:05,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:05,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-19 00:07:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-19 00:07:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:07:05,583 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-11-19 00:07:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:05,938 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-19 00:07:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-19 00:07:05,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-19 00:07:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 00:07:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-19 00:07:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 00:07:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-19 00:07:05,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2018-11-19 00:07:06,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:06,043 INFO L225 Difference]: With dead ends: 47 [2018-11-19 00:07:06,043 INFO L226 Difference]: Without dead ends: 30 [2018-11-19 00:07:06,044 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:07:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-19 00:07:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-19 00:07:06,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:06,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-19 00:07:06,080 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-19 00:07:06,080 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-19 00:07:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:06,083 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-19 00:07:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-19 00:07:06,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:06,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:06,084 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-19 00:07:06,084 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-19 00:07:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:06,086 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-19 00:07:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-19 00:07:06,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:06,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:06,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:06,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-19 00:07:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-19 00:07:06,090 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2018-11-19 00:07:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:06,090 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-19 00:07:06,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-19 00:07:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-19 00:07:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-19 00:07:06,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:06,092 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:06,092 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:06,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:06,092 INFO L82 PathProgramCache]: Analyzing trace with hash 244005440, now seen corresponding path program 3 times [2018-11-19 00:07:06,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:06,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:06,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:06,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:07:06,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:06,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {859#true} is VALID [2018-11-19 00:07:06,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,257 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {859#true} {859#true} #60#return; {859#true} is VALID [2018-11-19 00:07:06,258 INFO L256 TraceCheckUtils]: 3: Hoare triple {859#true} call #t~ret1 := main(); {859#true} is VALID [2018-11-19 00:07:06,258 INFO L273 TraceCheckUtils]: 4: Hoare triple {859#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {859#true} is VALID [2018-11-19 00:07:06,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {859#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {859#true} is VALID [2018-11-19 00:07:06,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {859#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {859#true} is VALID [2018-11-19 00:07:06,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {859#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {859#true} is VALID [2018-11-19 00:07:06,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {859#true} assume !(~j~0 < 20); {859#true} is VALID [2018-11-19 00:07:06,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {859#true} ~k~0 := 4; {859#true} is VALID [2018-11-19 00:07:06,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {859#true} assume !(~k~0 <= 3); {859#true} is VALID [2018-11-19 00:07:06,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {859#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {859#true} is VALID [2018-11-19 00:07:06,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-19 00:07:06,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {859#true} assume !(~j~0 < 20); {859#true} is VALID [2018-11-19 00:07:06,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {859#true} ~k~0 := 4; {861#(= main_~k~0 4)} is VALID [2018-11-19 00:07:06,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {861#(= main_~k~0 4)} assume true; {861#(= main_~k~0 4)} is VALID [2018-11-19 00:07:06,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {861#(= main_~k~0 4)} assume !(~k~0 <= 3); {861#(= main_~k~0 4)} is VALID [2018-11-19 00:07:06,267 INFO L273 TraceCheckUtils]: 23: Hoare triple {861#(= main_~k~0 4)} assume true; {861#(= main_~k~0 4)} is VALID [2018-11-19 00:07:06,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {861#(= main_~k~0 4)} assume !(~i~0 <= 100); {861#(= main_~k~0 4)} is VALID [2018-11-19 00:07:06,270 INFO L256 TraceCheckUtils]: 25: Hoare triple {861#(= main_~k~0 4)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {862#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:07:06,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {862#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {863#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-19 00:07:06,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {863#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {860#false} is VALID [2018-11-19 00:07:06,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {860#false} assume !false; {860#false} is VALID [2018-11-19 00:07:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-19 00:07:06,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:06,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 00:07:06,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-19 00:07:06,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:06,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:07:06,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:06,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:07:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:07:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:07:06,375 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-19 00:07:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:06,532 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-19 00:07:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 00:07:06,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-19 00:07:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:07:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-19 00:07:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:07:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-19 00:07:06,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2018-11-19 00:07:06,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:06,603 INFO L225 Difference]: With dead ends: 44 [2018-11-19 00:07:06,603 INFO L226 Difference]: Without dead ends: 0 [2018-11-19 00:07:06,604 INFO L604 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-19 00:07:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-19 00:07:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-19 00:07:06,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:06,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:06,606 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:06,606 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:06,606 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:06,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:06,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:06,607 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:06,607 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:06,607 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:06,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:06,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:06,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:06,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-19 00:07:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-19 00:07:06,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-19 00:07:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:06,609 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-19 00:07:06,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:07:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:06,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:06,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-19 00:07:06,756 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-19 00:07:06,756 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:06,756 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:06,757 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-19 00:07:06,757 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:06,757 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:06,757 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-19 00:07:06,757 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 27) no Hoare annotation was computed. [2018-11-19 00:07:06,758 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-11-19 00:07:06,758 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (= main_~k~0 4) [2018-11-19 00:07:06,758 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 15 24) the Hoare annotation is: (or (= main_~k~0 4) (and (<= (+ main_~j~0 100) main_~i~0) (<= main_~i~0 0))) [2018-11-19 00:07:06,758 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 19) no Hoare annotation was computed. [2018-11-19 00:07:06,758 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 24) no Hoare annotation was computed. [2018-11-19 00:07:06,758 INFO L421 ceAbstractionStarter]: At program point L17-3(lines 17 19) the Hoare annotation is: (or (= main_~k~0 4) (<= main_~i~0 1)) [2018-11-19 00:07:06,759 INFO L425 ceAbstractionStarter]: For program point L17-4(lines 17 19) no Hoare annotation was computed. [2018-11-19 00:07:06,759 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 27) no Hoare annotation was computed. [2018-11-19 00:07:06,759 INFO L421 ceAbstractionStarter]: At program point L15-3(lines 15 24) the Hoare annotation is: (= main_~k~0 4) [2018-11-19 00:07:06,759 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 27) the Hoare annotation is: true [2018-11-19 00:07:06,759 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-19 00:07:06,759 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-19 00:07:06,759 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-19 00:07:06,760 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-19 00:07:06,760 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-19 00:07:06,760 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-19 00:07:06,762 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:06,776 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:06,776 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:06,776 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:06,776 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-19 00:07:06,790 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:06,790 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:06,790 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:06,790 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-19 00:07:06,790 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-19 00:07:06,790 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-19 00:07:06,791 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:06,792 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-19 00:07:06,792 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-19 00:07:06,792 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-19 00:07:06,792 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-19 00:07:06,792 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-19 00:07:06,801 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-19 00:07:06,801 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-19 00:07:06,801 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-19 00:07:06,801 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-19 00:07:06,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:07:06 BoogieIcfgContainer [2018-11-19 00:07:06,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-19 00:07:06,813 INFO L168 Benchmark]: Toolchain (without parser) took 5511.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -494.2 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:06,815 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-19 00:07:06,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.99 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:06,817 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 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-19 00:07:06,817 INFO L168 Benchmark]: RCFGBuilder took 593.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:06,818 INFO L168 Benchmark]: TraceAbstraction took 4605.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:06,823 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 265.99 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.51 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 593.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4605.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.1 MB). Peak memory consumption was 268.1 MB. 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: 15]: Loop Invariant Derived loop invariant: k == 4 || (j + 100 <= i && i <= 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: k == 4 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: k == 4 || i <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 9 SDslu, 156 SDs, 0 SdLazy, 34 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 31 HoareAnnotationTreeSize, 15 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 6480 SizeOfPredicates, 3 NumberOfNonLiveVariables, 92 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 51/61 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...