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/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:14:58,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:14:58,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:14:58,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:14:58,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:14:58,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:14:58,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:14:58,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:14:58,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:14:58,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:14:58,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:14:58,484 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:14:58,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:14:58,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:14:58,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:14:58,491 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:14:58,492 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:14:58,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:14:58,498 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:14:58,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:14:58,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:14:58,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:14:58,510 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:14:58,510 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:14:58,510 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:14:58,511 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:14:58,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:14:58,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:14:58,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:14:58,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:14:58,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:14:58,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:14:58,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:14:58,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:14:58,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:14:58,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:14:58,519 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-14 17:14:58,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:14:58,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:14:58,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:14:58,535 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:14:58,536 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:14:58,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:14:58,536 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:14:58,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:14:58,537 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:14:58,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:14:58,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:14:58,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:14:58,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:14:58,538 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:14:58,538 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:14:58,538 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:14:58,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:14:58,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:14:58,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:14:58,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:14:58,539 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:14:58,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:14:58,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:14:58,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:14:58,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:14:58,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:14:58,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:14:58,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:14:58,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:14:58,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:14:58,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:14:58,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:14:58,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:14:58,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:14:58,616 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:14:58,617 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-14 17:14:58,687 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16155cf/2ae8725dd03a48a3b966f1aad5458da4/FLAG3c34ddb66 [2018-11-14 17:14:59,167 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:14:59,168 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-14 17:14:59,176 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16155cf/2ae8725dd03a48a3b966f1aad5458da4/FLAG3c34ddb66 [2018-11-14 17:14:59,190 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16155cf/2ae8725dd03a48a3b966f1aad5458da4 [2018-11-14 17:14:59,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:14:59,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:14:59,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:14:59,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:14:59,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:14:59,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbbc36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59, skipping insertion in model container [2018-11-14 17:14:59,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:14:59,253 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:14:59,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:14:59,450 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:14:59,475 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:14:59,492 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:14:59,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59 WrapperNode [2018-11-14 17:14:59,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:14:59,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:14:59,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:14:59,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:14:59,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (1/1) ... [2018-11-14 17:14:59,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:14:59,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:14:59,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:14:59,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:14:59,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (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-14 17:14:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:14:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:14:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-14 17:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-14 17:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-14 17:14:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:14:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:14:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:15:00,248 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:15:00,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:15:00 BoogieIcfgContainer [2018-11-14 17:15:00,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:15:00,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:15:00,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:15:00,253 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:15:00,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:14:59" (1/3) ... [2018-11-14 17:15:00,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39746a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:15:00, skipping insertion in model container [2018-11-14 17:15:00,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:59" (2/3) ... [2018-11-14 17:15:00,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39746a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:15:00, skipping insertion in model container [2018-11-14 17:15:00,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:15:00" (3/3) ... [2018-11-14 17:15:00,257 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b_true-unreach-call_false-termination.cil.c [2018-11-14 17:15:00,268 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:15:00,277 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:15:00,293 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:15:00,325 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:15:00,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:15:00,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:15:00,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:15:00,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:15:00,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:15:00,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:15:00,327 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:15:00,327 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:15:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 17:15:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-14 17:15:00,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:15:00,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:15:00,357 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:15:00,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:15:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1652704230, now seen corresponding path program 1 times [2018-11-14 17:15:00,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:15:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:15:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:15:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:15:00,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 17:15:00,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 17:15:00,588 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #106#return; {32#true} is VALID [2018-11-14 17:15:00,588 INFO L256 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-14 17:15:00,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {34#(<= main_~blastFlag~0 0)} is VALID [2018-11-14 17:15:00,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#(<= main_~blastFlag~0 0)} assume true; {34#(<= main_~blastFlag~0 0)} is VALID [2018-11-14 17:15:00,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#(<= main_~blastFlag~0 0)} assume !false; {34#(<= main_~blastFlag~0 0)} is VALID [2018-11-14 17:15:00,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#(<= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {33#false} is VALID [2018-11-14 17:15:00,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 17:15:00,597 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-14 17:15:00,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:15:00,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:15:00,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 17:15:00,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:15:00,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:15:00,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:00,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:15:00,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:15:00,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:15:00,710 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-14 17:15:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:01,260 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-11-14 17:15:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:15:01,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 17:15:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:15:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2018-11-14 17:15:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2018-11-14 17:15:01,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2018-11-14 17:15:01,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:01,823 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:15:01,823 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 17:15:01,827 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-14 17:15:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 17:15:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-14 17:15:02,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:15:02,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-14 17:15:02,124 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 17:15:02,125 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 17:15:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:02,131 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2018-11-14 17:15:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2018-11-14 17:15:02,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:02,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:02,133 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-14 17:15:02,133 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-14 17:15:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:02,140 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2018-11-14 17:15:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2018-11-14 17:15:02,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:02,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:02,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:15:02,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:15:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:15:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2018-11-14 17:15:02,147 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 9 [2018-11-14 17:15:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:15:02,148 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2018-11-14 17:15:02,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:15:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2018-11-14 17:15:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:15:02,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:15:02,150 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:15:02,150 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:15:02,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:15:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1430507829, now seen corresponding path program 1 times [2018-11-14 17:15:02,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:15:02,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:15:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:02,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:15:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:15:02,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2018-11-14 17:15:02,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-14 17:15:02,233 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {272#true} {272#true} #106#return; {272#true} is VALID [2018-11-14 17:15:02,233 INFO L256 TraceCheckUtils]: 3: Hoare triple {272#true} call #t~ret2 := main(); {272#true} is VALID [2018-11-14 17:15:02,234 INFO L273 TraceCheckUtils]: 4: Hoare triple {272#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {272#true} is VALID [2018-11-14 17:15:02,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {272#true} assume true; {272#true} is VALID [2018-11-14 17:15:02,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {272#true} assume !false; {272#true} is VALID [2018-11-14 17:15:02,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {272#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {272#true} is VALID [2018-11-14 17:15:02,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {272#true} assume ~s__state~0 == 8466; {272#true} is VALID [2018-11-14 17:15:02,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {272#true} assume ~blastFlag~0 == 0;~blastFlag~0 := 2; {272#true} is VALID [2018-11-14 17:15:02,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {272#true} assume ~s__hit~0 != 0;~s__state~0 := 8656; {274#(<= 8656 main_~s__state~0)} is VALID [2018-11-14 17:15:02,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {274#(<= 8656 main_~s__state~0)} assume true; {274#(<= 8656 main_~s__state~0)} is VALID [2018-11-14 17:15:02,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {274#(<= 8656 main_~s__state~0)} assume !false; {274#(<= 8656 main_~s__state~0)} is VALID [2018-11-14 17:15:02,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {274#(<= 8656 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {273#false} is VALID [2018-11-14 17:15:02,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {273#false} assume !false; {273#false} is VALID [2018-11-14 17:15:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:15:02,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:15:02,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:15:02,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:15:02,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:15:02,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:15:02,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:02,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:15:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:15:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:15:02,344 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand 3 states. [2018-11-14 17:15:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:02,589 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2018-11-14 17:15:02,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:15:02,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:15:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:15:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:15:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:15:02,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-14 17:15:02,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:02,837 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:15:02,838 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:15:02,839 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-14 17:15:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:15:02,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-14 17:15:02,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:15:02,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-14 17:15:02,879 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-14 17:15:02,879 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-14 17:15:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:02,884 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-14 17:15:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-14 17:15:02,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:02,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:02,885 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-14 17:15:02,886 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-14 17:15:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:02,890 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-14 17:15:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2018-11-14 17:15:02,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:02,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:02,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:15:02,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:15:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:15:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2018-11-14 17:15:02,896 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 15 [2018-11-14 17:15:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:15:02,896 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2018-11-14 17:15:02,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:15:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2018-11-14 17:15:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:15:02,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:15:02,898 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:15:02,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:15:02,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:15:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1432354871, now seen corresponding path program 1 times [2018-11-14 17:15:02,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:15:02,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:15:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:02,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:15:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:15:02,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2018-11-14 17:15:02,976 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-14 17:15:02,977 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {583#true} {583#true} #106#return; {583#true} is VALID [2018-11-14 17:15:02,977 INFO L256 TraceCheckUtils]: 3: Hoare triple {583#true} call #t~ret2 := main(); {583#true} is VALID [2018-11-14 17:15:02,977 INFO L273 TraceCheckUtils]: 4: Hoare triple {583#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {583#true} is VALID [2018-11-14 17:15:02,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {583#true} assume true; {583#true} is VALID [2018-11-14 17:15:02,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {583#true} assume !false; {583#true} is VALID [2018-11-14 17:15:02,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {583#true} is VALID [2018-11-14 17:15:02,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {583#true} assume ~s__state~0 == 8466; {583#true} is VALID [2018-11-14 17:15:02,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {583#true} assume ~blastFlag~0 == 0;~blastFlag~0 := 2; {585#(<= main_~blastFlag~0 2)} is VALID [2018-11-14 17:15:02,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {585#(<= main_~blastFlag~0 2)} assume !(~s__hit~0 != 0);~s__state~0 := 8512; {585#(<= main_~blastFlag~0 2)} is VALID [2018-11-14 17:15:02,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {585#(<= main_~blastFlag~0 2)} assume true; {585#(<= main_~blastFlag~0 2)} is VALID [2018-11-14 17:15:02,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {585#(<= main_~blastFlag~0 2)} assume !false; {585#(<= main_~blastFlag~0 2)} is VALID [2018-11-14 17:15:02,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {585#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {584#false} is VALID [2018-11-14 17:15:02,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {584#false} assume !false; {584#false} is VALID [2018-11-14 17:15:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:15:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:15:02,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:15:02,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:15:02,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:15:02,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:15:03,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:03,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:15:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:15:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:15:03,032 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 3 states. [2018-11-14 17:15:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:03,352 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2018-11-14 17:15:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:15:03,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:15:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:15:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-14 17:15:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2018-11-14 17:15:03,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2018-11-14 17:15:03,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:03,534 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:15:03,534 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:15:03,538 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-14 17:15:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:15:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-14 17:15:03,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:15:03,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-14 17:15:03,600 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 17:15:03,600 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 17:15:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:03,604 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2018-11-14 17:15:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2018-11-14 17:15:03,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:03,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:03,606 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 17:15:03,606 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 17:15:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:03,611 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2018-11-14 17:15:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2018-11-14 17:15:03,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:03,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:03,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:15:03,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:15:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 17:15:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2018-11-14 17:15:03,617 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 15 [2018-11-14 17:15:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:15:03,617 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2018-11-14 17:15:03,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:15:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2018-11-14 17:15:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:15:03,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:15:03,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:15:03,619 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:15:03,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:15:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -590266670, now seen corresponding path program 1 times [2018-11-14 17:15:03,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:15:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:15:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:15:03,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:15:03,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {970#true} call ULTIMATE.init(); {970#true} is VALID [2018-11-14 17:15:03,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-14 17:15:03,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {970#true} {970#true} #106#return; {970#true} is VALID [2018-11-14 17:15:03,708 INFO L256 TraceCheckUtils]: 3: Hoare triple {970#true} call #t~ret2 := main(); {970#true} is VALID [2018-11-14 17:15:03,709 INFO L273 TraceCheckUtils]: 4: Hoare triple {970#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {970#true} is VALID [2018-11-14 17:15:03,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-14 17:15:03,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {970#true} assume !false; {970#true} is VALID [2018-11-14 17:15:03,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {970#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {970#true} is VALID [2018-11-14 17:15:03,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {970#true} assume ~s__state~0 == 8466; {970#true} is VALID [2018-11-14 17:15:03,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {970#true} assume ~blastFlag~0 == 0;~blastFlag~0 := 2; {970#true} is VALID [2018-11-14 17:15:03,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {970#true} assume ~s__hit~0 != 0;~s__state~0 := 8656; {970#true} is VALID [2018-11-14 17:15:03,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {970#true} assume true; {970#true} is VALID [2018-11-14 17:15:03,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {970#true} assume !false; {970#true} is VALID [2018-11-14 17:15:03,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {970#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {970#true} is VALID [2018-11-14 17:15:03,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {970#true} assume !(~s__state~0 == 8466); {970#true} is VALID [2018-11-14 17:15:03,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {970#true} assume !(~s__state~0 == 8512); {970#true} is VALID [2018-11-14 17:15:03,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {970#true} assume !(~s__state~0 == 8640); {970#true} is VALID [2018-11-14 17:15:03,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {970#true} assume ~s__state~0 == 8656; {970#true} is VALID [2018-11-14 17:15:03,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {970#true} assume ~blastFlag~0 == 2;~blastFlag~0 := 3; {972#(<= main_~blastFlag~0 3)} is VALID [2018-11-14 17:15:03,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {972#(<= main_~blastFlag~0 3)} assume !(~blastFlag~0 == 4); {972#(<= main_~blastFlag~0 3)} is VALID [2018-11-14 17:15:03,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {972#(<= main_~blastFlag~0 3)} assume ~blastFlag~0 == 5; {971#false} is VALID [2018-11-14 17:15:03,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#false} assume !false; {971#false} is VALID [2018-11-14 17:15:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:15:03,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:15:03,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:15:03,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 17:15:03,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:15:03,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:15:03,754 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-14 17:15:03,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:15:03,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:15:03,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:15:03,755 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand 3 states. [2018-11-14 17:15:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:03,959 INFO L93 Difference]: Finished difference Result 149 states and 199 transitions. [2018-11-14 17:15:03,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:15:03,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 17:15:03,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:15:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-14 17:15:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-14 17:15:03,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-14 17:15:04,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:04,133 INFO L225 Difference]: With dead ends: 149 [2018-11-14 17:15:04,133 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 17:15:04,134 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-14 17:15:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 17:15:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-14 17:15:04,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:15:04,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-14 17:15:04,199 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-14 17:15:04,199 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-14 17:15:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:04,204 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2018-11-14 17:15:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-11-14 17:15:04,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:04,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:04,205 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-14 17:15:04,205 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-14 17:15:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:04,210 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2018-11-14 17:15:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2018-11-14 17:15:04,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:04,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:04,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:15:04,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:15:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 17:15:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2018-11-14 17:15:04,217 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 131 transitions. Word has length 22 [2018-11-14 17:15:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:15:04,217 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-11-14 17:15:04,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:15:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 131 transitions. [2018-11-14 17:15:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:15:04,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:15:04,218 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:15:04,219 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:15:04,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:15:04,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2071970430, now seen corresponding path program 1 times [2018-11-14 17:15:04,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:15:04,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:15:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:04,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:15:04,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:15:04,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {1497#true} call ULTIMATE.init(); {1497#true} is VALID [2018-11-14 17:15:04,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {1497#true} assume true; {1497#true} is VALID [2018-11-14 17:15:04,275 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1497#true} {1497#true} #106#return; {1497#true} is VALID [2018-11-14 17:15:04,275 INFO L256 TraceCheckUtils]: 3: Hoare triple {1497#true} call #t~ret2 := main(); {1497#true} is VALID [2018-11-14 17:15:04,276 INFO L273 TraceCheckUtils]: 4: Hoare triple {1497#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1497#true} is VALID [2018-11-14 17:15:04,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {1497#true} assume true; {1497#true} is VALID [2018-11-14 17:15:04,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#true} assume !false; {1497#true} is VALID [2018-11-14 17:15:04,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {1497#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1497#true} is VALID [2018-11-14 17:15:04,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {1497#true} assume ~s__state~0 == 8466; {1497#true} is VALID [2018-11-14 17:15:04,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {1497#true} assume ~blastFlag~0 == 0;~blastFlag~0 := 2; {1497#true} is VALID [2018-11-14 17:15:04,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {1497#true} assume ~s__hit~0 != 0;~s__state~0 := 8656; {1497#true} is VALID [2018-11-14 17:15:04,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {1497#true} assume true; {1497#true} is VALID [2018-11-14 17:15:04,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {1497#true} assume !false; {1497#true} is VALID [2018-11-14 17:15:04,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {1497#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1497#true} is VALID [2018-11-14 17:15:04,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {1497#true} assume !(~s__state~0 == 8466); {1497#true} is VALID [2018-11-14 17:15:04,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {1497#true} assume !(~s__state~0 == 8512); {1497#true} is VALID [2018-11-14 17:15:04,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {1497#true} assume !(~s__state~0 == 8640); {1497#true} is VALID [2018-11-14 17:15:04,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {1497#true} assume ~s__state~0 == 8656; {1497#true} is VALID [2018-11-14 17:15:04,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {1497#true} assume ~blastFlag~0 == 2;~blastFlag~0 := 3; {1497#true} is VALID [2018-11-14 17:15:04,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {1497#true} assume !(~blastFlag~0 == 4); {1497#true} is VALID [2018-11-14 17:15:04,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {1497#true} assume !(~blastFlag~0 == 5); {1497#true} is VALID [2018-11-14 17:15:04,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {1497#true} assume ~s__hit~0 != 0;~s__state~0 := 8640; {1499#(<= 8640 main_~s__state~0)} is VALID [2018-11-14 17:15:04,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {1499#(<= 8640 main_~s__state~0)} assume true; {1499#(<= 8640 main_~s__state~0)} is VALID [2018-11-14 17:15:04,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {1499#(<= 8640 main_~s__state~0)} assume !false; {1499#(<= 8640 main_~s__state~0)} is VALID [2018-11-14 17:15:04,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {1499#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1498#false} is VALID [2018-11-14 17:15:04,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#false} assume !false; {1498#false} is VALID [2018-11-14 17:15:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:15:04,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:15:04,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:15:04,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 17:15:04,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:15:04,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:15:04,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:04,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:15:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:15:04,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:15:04,338 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. Second operand 3 states. [2018-11-14 17:15:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:04,586 INFO L93 Difference]: Finished difference Result 199 states and 263 transitions. [2018-11-14 17:15:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:15:04,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 17:15:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:15:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2018-11-14 17:15:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2018-11-14 17:15:04,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2018-11-14 17:15:04,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:04,679 INFO L225 Difference]: With dead ends: 199 [2018-11-14 17:15:04,679 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 17:15:04,680 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-14 17:15:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 17:15:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-14 17:15:04,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:15:04,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-14 17:15:04,789 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-14 17:15:04,789 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-14 17:15:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:04,793 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-14 17:15:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-14 17:15:04,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:04,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:04,794 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-14 17:15:04,794 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-14 17:15:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:04,797 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-14 17:15:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2018-11-14 17:15:04,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:04,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:04,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:15:04,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:15:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 17:15:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2018-11-14 17:15:04,802 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 26 [2018-11-14 17:15:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:15:04,802 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2018-11-14 17:15:04,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:15:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2018-11-14 17:15:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:15:04,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:15:04,804 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:15:04,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:15:04,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:15:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1346446477, now seen corresponding path program 1 times [2018-11-14 17:15:04,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:15:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:15:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:15:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:15:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:15:04,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2018-11-14 17:15:04,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {2026#true} assume true; {2026#true} is VALID [2018-11-14 17:15:04,878 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} #106#return; {2026#true} is VALID [2018-11-14 17:15:04,878 INFO L256 TraceCheckUtils]: 3: Hoare triple {2026#true} call #t~ret2 := main(); {2026#true} is VALID [2018-11-14 17:15:04,878 INFO L273 TraceCheckUtils]: 4: Hoare triple {2026#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~s__hit~0 := #t~nondet0;havoc #t~nondet0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2026#true} is VALID [2018-11-14 17:15:04,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {2026#true} assume true; {2026#true} is VALID [2018-11-14 17:15:04,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {2026#true} assume !false; {2026#true} is VALID [2018-11-14 17:15:04,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {2026#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2026#true} is VALID [2018-11-14 17:15:04,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {2026#true} assume ~s__state~0 == 8466; {2026#true} is VALID [2018-11-14 17:15:04,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {2026#true} assume ~blastFlag~0 == 0;~blastFlag~0 := 2; {2026#true} is VALID [2018-11-14 17:15:04,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {2026#true} assume ~s__hit~0 != 0;~s__state~0 := 8656; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume true; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !false; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 == 8466); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 == 8512); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 == 8640); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume ~s__state~0 == 8656; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume ~blastFlag~0 == 2;~blastFlag~0 := 3; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~blastFlag~0 == 4); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~blastFlag~0 == 5); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume ~s__hit~0 != 0;~s__state~0 := 8640; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume true; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !false; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 == 8466); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,907 INFO L273 TraceCheckUtils]: 26: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__state~0 == 8512); {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume ~s__state~0 == 8640; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume ~blastFlag~0 == 3;~blastFlag~0 := 4; {2028#(not (= 0 main_~s__hit~0))} is VALID [2018-11-14 17:15:04,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {2028#(not (= 0 main_~s__hit~0))} assume !(~s__hit~0 != 0);~s__state~0 := 8656; {2027#false} is VALID [2018-11-14 17:15:04,911 INFO L273 TraceCheckUtils]: 30: Hoare triple {2027#false} assume true; {2027#false} is VALID [2018-11-14 17:15:04,912 INFO L273 TraceCheckUtils]: 31: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2018-11-14 17:15:04,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {2027#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2027#false} is VALID [2018-11-14 17:15:04,912 INFO L273 TraceCheckUtils]: 33: Hoare triple {2027#false} assume !(~s__state~0 == 8466); {2027#false} is VALID [2018-11-14 17:15:04,912 INFO L273 TraceCheckUtils]: 34: Hoare triple {2027#false} assume !(~s__state~0 == 8512); {2027#false} is VALID [2018-11-14 17:15:04,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {2027#false} assume !(~s__state~0 == 8640); {2027#false} is VALID [2018-11-14 17:15:04,913 INFO L273 TraceCheckUtils]: 36: Hoare triple {2027#false} assume ~s__state~0 == 8656; {2027#false} is VALID [2018-11-14 17:15:04,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {2027#false} assume !(~blastFlag~0 == 2); {2027#false} is VALID [2018-11-14 17:15:04,913 INFO L273 TraceCheckUtils]: 38: Hoare triple {2027#false} assume !(~blastFlag~0 == 4); {2027#false} is VALID [2018-11-14 17:15:04,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {2027#false} assume ~blastFlag~0 == 5; {2027#false} is VALID [2018-11-14 17:15:04,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2018-11-14 17:15:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:15:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:15:04,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:15:04,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-14 17:15:04,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:15:04,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:15:04,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:04,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:15:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:15:04,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:15:04,971 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand 3 states. [2018-11-14 17:15:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:05,135 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2018-11-14 17:15:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:15:05,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-14 17:15:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:15:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 17:15:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:15:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 17:15:05,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-14 17:15:05,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:15:05,251 INFO L225 Difference]: With dead ends: 137 [2018-11-14 17:15:05,251 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:15:05,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-14 17:15:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:15:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:15:05,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:15:05,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:15:05,255 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:15:05,255 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:15:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:05,255 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:15:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:15:05,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:05,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:05,256 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:15:05,256 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:15:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:15:05,257 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:15:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:15:05,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:05,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:15:05,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:15:05,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:15:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:15:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:15:05,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-14 17:15:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:15:05,259 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:15:05,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:15:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:15:05,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:15:05,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:15:05,538 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:15:05,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:15:05,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:15:05,538 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:15:05,538 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:15:05,538 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:15:05,538 INFO L421 ceAbstractionStarter]: At program point L97(lines 9 141) the Hoare annotation is: false [2018-11-14 17:15:05,539 INFO L421 ceAbstractionStarter]: At program point L31(lines 30 125) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-14 17:15:05,539 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 17:15:05,539 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 141) no Hoare annotation was computed. [2018-11-14 17:15:05,539 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 17:15:05,539 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-14 17:15:05,539 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2018-11-14 17:15:05,539 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 128) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 54 107) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 109) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 111) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 141) no Hoare annotation was computed. [2018-11-14 17:15:05,540 INFO L428 ceAbstractionStarter]: At program point L137(lines 9 141) the Hoare annotation is: true [2018-11-14 17:15:05,540 INFO L421 ceAbstractionStarter]: At program point L100(lines 18 135) the Hoare annotation is: (or (and (<= 8640 main_~s__state~0) (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (<= main_~blastFlag~0 2)) [2018-11-14 17:15:05,541 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 98) no Hoare annotation was computed. [2018-11-14 17:15:05,541 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 125) no Hoare annotation was computed. [2018-11-14 17:15:05,541 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 141) the Hoare annotation is: true [2018-11-14 17:15:05,541 INFO L421 ceAbstractionStarter]: At program point L26(lines 25 128) the Hoare annotation is: (<= main_~blastFlag~0 2) [2018-11-14 17:15:05,541 INFO L421 ceAbstractionStarter]: At program point L51(lines 50 109) the Hoare annotation is: (let ((.cse0 (<= 8656 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 2)) (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))))) [2018-11-14 17:15:05,541 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 135) no Hoare annotation was computed. [2018-11-14 17:15:05,541 INFO L421 ceAbstractionStarter]: At program point L47(lines 46 111) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (<= main_~blastFlag~0 3) (not (= 0 main_~s__hit~0))) (and .cse0 (<= main_~blastFlag~0 2)))) [2018-11-14 17:15:05,543 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:15:05,549 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:15:05,549 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:15:05,549 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:15:05,549 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:15:05,550 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:15:05,550 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:15:05,550 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:15:05,550 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:15:05,550 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:15:05,550 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 17:15:05,551 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 17:15:05,552 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 17:15:05,552 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-14 17:15:05,552 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 17:15:05,552 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-14 17:15:05,552 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-14 17:15:05,552 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2018-11-14 17:15:05,553 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 17:15:05,554 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 17:15:05,554 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:15:05,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:15:05 BoogieIcfgContainer [2018-11-14 17:15:05,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:15:05,567 INFO L168 Benchmark]: Toolchain (without parser) took 6366.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -411.5 MB). Peak memory consumption was 317.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:15:05,569 INFO L168 Benchmark]: CDTParser took 0.21 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-14 17:15:05,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:15:05,570 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 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-14 17:15:05,571 INFO L168 Benchmark]: RCFGBuilder took 711.50 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:15:05,572 INFO L168 Benchmark]: TraceAbstraction took 5315.38 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 342.2 MB). Peak memory consumption was 342.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:15:05,576 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.63 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 711.50 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.2 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5315.38 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 342.2 MB). Peak memory consumption was 342.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (8656 <= s__state && blastFlag <= 2) || ((8656 <= s__state && blastFlag <= 3) && !(0 == s__hit)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((8640 <= s__state && blastFlag <= 3) && !(0 == s__hit)) || (8640 <= s__state && blastFlag <= 2) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. SAFE Result, 5.2s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 93 SDslu, 115 SDs, 0 SdLazy, 95 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=4, 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.6s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 34 NumberOfFragments, 65 HoareAnnotationTreeSize, 11 FomulaSimplifications, 175 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 5880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 54/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...