/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label26.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:32:37,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:32:37,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:32:37,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:32:37,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:32:37,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:32:37,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:32:37,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:32:37,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:32:37,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:32:37,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:32:37,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:32:37,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:32:37,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:32:37,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:32:37,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:32:37,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:32:37,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:32:37,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:32:37,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:32:37,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:32:37,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:32:37,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:32:37,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:32:37,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:32:37,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:32:37,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:32:37,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:32:37,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:32:37,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:32:37,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:32:37,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:32:37,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:32:37,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:32:37,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:32:37,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:32:37,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:32:37,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:32:37,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:32:37,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:32:37,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:32:37,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:32:37,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:32:37,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:32:37,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:32:37,581 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:32:37,581 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:32:37,581 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:32:37,582 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:32:37,582 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:32:37,582 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:32:37,582 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:32:37,583 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:32:37,584 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:32:37,584 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:32:37,584 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:32:37,585 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:32:37,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:32:37,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:32:37,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:32:37,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:32:37,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:32:37,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:32:37,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:32:37,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:32:37,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:32:37,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:32:37,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:32:37,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:32:37,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:32:37,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:32:37,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:32:37,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:32:37,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:32:37,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:32:37,590 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:32:37,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:32:37,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:32:37,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:32:37,591 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:32:37,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:32:37,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:32:37,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:32:37,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:32:37,920 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:32:37,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label26.c [2019-11-23 23:32:37,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07beda965/bf107611cbc643baa926389bd9afeb55/FLAG362c78064 [2019-11-23 23:32:38,517 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:32:38,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label26.c [2019-11-23 23:32:38,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07beda965/bf107611cbc643baa926389bd9afeb55/FLAG362c78064 [2019-11-23 23:32:38,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07beda965/bf107611cbc643baa926389bd9afeb55 [2019-11-23 23:32:38,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:32:38,832 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:32:38,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:38,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:32:38,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:32:38,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:38" (1/1) ... [2019-11-23 23:32:38,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657855ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:38, skipping insertion in model container [2019-11-23 23:32:38,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:38" (1/1) ... [2019-11-23 23:32:38,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:32:38,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:32:39,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:39,413 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:32:39,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:32:39,522 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:32:39,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39 WrapperNode [2019-11-23 23:32:39,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:32:39,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:39,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:32:39,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:32:39,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:32:39,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:32:39,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:32:39,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:32:39,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (1/1) ... [2019-11-23 23:32:39,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:32:39,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:32:39,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:32:39,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:32:39,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (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 [2019-11-23 23:32:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:32:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:41,730 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:41,730 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:41,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:41 BoogieIcfgContainer [2019-11-23 23:32:41,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:41,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:41,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:41,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:41,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:38" (1/3) ... [2019-11-23 23:32:41,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b16616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:41, skipping insertion in model container [2019-11-23 23:32:41,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:39" (2/3) ... [2019-11-23 23:32:41,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b16616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:41, skipping insertion in model container [2019-11-23 23:32:41,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:41" (3/3) ... [2019-11-23 23:32:41,742 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label26.c [2019-11-23 23:32:41,751 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:41,760 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:41,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:41,811 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:41,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:41,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:41,812 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:41,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:41,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:41,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:41,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:41,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:41,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:41,848 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 925962511, now seen corresponding path program 1 times [2019-11-23 23:32:41,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:41,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517388654] [2019-11-23 23:32:41,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:42,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517388654] [2019-11-23 23:32:42,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:42,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:42,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123074929] [2019-11-23 23:32:42,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:42,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:42,341 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:43,314 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:43,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:43,335 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:43,335 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:43,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-23 23:32:43,406 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-23 23:32:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:43,408 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-23 23:32:43,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-23 23:32:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:43,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:43,413 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:43,414 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash 221762990, now seen corresponding path program 1 times [2019-11-23 23:32:43,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:43,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463847871] [2019-11-23 23:32:43,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:43,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463847871] [2019-11-23 23:32:43,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:43,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:43,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949055076] [2019-11-23 23:32:43,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:43,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:43,525 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-23 23:32:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:44,153 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-23 23:32:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:44,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:44,159 INFO L225 Difference]: With dead ends: 807 [2019-11-23 23:32:44,159 INFO L226 Difference]: Without dead ends: 565 [2019-11-23 23:32:44,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-23 23:32:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-23 23:32:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-23 23:32:44,195 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-23 23:32:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:44,195 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-23 23:32:44,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-23 23:32:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:44,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:44,200 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:44,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:44,201 INFO L82 PathProgramCache]: Analyzing trace with hash -875182237, now seen corresponding path program 1 times [2019-11-23 23:32:44,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:44,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914392038] [2019-11-23 23:32:44,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:44,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914392038] [2019-11-23 23:32:44,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:44,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:44,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568111005] [2019-11-23 23:32:44,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:44,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:44,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:44,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:44,268 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-23 23:32:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:44,983 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-23 23:32:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:44,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 23:32:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:44,992 INFO L225 Difference]: With dead ends: 1445 [2019-11-23 23:32:44,992 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:44,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-23 23:32:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-23 23:32:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1446 transitions. [2019-11-23 23:32:45,039 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1446 transitions. Word has length 102 [2019-11-23 23:32:45,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:45,040 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1446 transitions. [2019-11-23 23:32:45,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1446 transitions. [2019-11-23 23:32:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:45,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:45,047 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:45,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash 11628216, now seen corresponding path program 1 times [2019-11-23 23:32:45,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:45,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158169148] [2019-11-23 23:32:45,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:45,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158169148] [2019-11-23 23:32:45,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:45,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:45,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649406490] [2019-11-23 23:32:45,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:45,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:45,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:45,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:45,116 INFO L87 Difference]: Start difference. First operand 883 states and 1446 transitions. Second operand 3 states. [2019-11-23 23:32:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:45,592 INFO L93 Difference]: Finished difference Result 2165 states and 3502 transitions. [2019-11-23 23:32:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:45,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:32:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:45,600 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:32:45,600 INFO L226 Difference]: Without dead ends: 1283 [2019-11-23 23:32:45,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:45,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-23 23:32:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-23 23:32:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-23 23:32:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1842 transitions. [2019-11-23 23:32:45,637 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1842 transitions. Word has length 102 [2019-11-23 23:32:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:45,637 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1842 transitions. [2019-11-23 23:32:45,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1842 transitions. [2019-11-23 23:32:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-23 23:32:45,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:45,641 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:45,642 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2118162671, now seen corresponding path program 1 times [2019-11-23 23:32:45,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:45,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537770324] [2019-11-23 23:32:45,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:45,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537770324] [2019-11-23 23:32:45,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:45,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:45,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698830997] [2019-11-23 23:32:45,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:45,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:45,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:45,740 INFO L87 Difference]: Start difference. First operand 1283 states and 1842 transitions. Second operand 3 states. [2019-11-23 23:32:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:46,139 INFO L93 Difference]: Finished difference Result 3045 states and 4319 transitions. [2019-11-23 23:32:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:46,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-23 23:32:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:46,147 INFO L225 Difference]: With dead ends: 3045 [2019-11-23 23:32:46,148 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:32:46,151 INFO L630 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 [2019-11-23 23:32:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:32:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1123. [2019-11-23 23:32:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1463 transitions. [2019-11-23 23:32:46,178 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1463 transitions. Word has length 107 [2019-11-23 23:32:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:46,179 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1463 transitions. [2019-11-23 23:32:46,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1463 transitions. [2019-11-23 23:32:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:32:46,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:46,182 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:46,182 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1735805931, now seen corresponding path program 1 times [2019-11-23 23:32:46,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:46,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807736410] [2019-11-23 23:32:46,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:46,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807736410] [2019-11-23 23:32:46,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:46,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:46,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286022588] [2019-11-23 23:32:46,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:46,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:46,313 INFO L87 Difference]: Start difference. First operand 1123 states and 1463 transitions. Second operand 4 states. [2019-11-23 23:32:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:46,883 INFO L93 Difference]: Finished difference Result 2725 states and 3556 transitions. [2019-11-23 23:32:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:46,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:32:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:46,891 INFO L225 Difference]: With dead ends: 2725 [2019-11-23 23:32:46,891 INFO L226 Difference]: Without dead ends: 1363 [2019-11-23 23:32:46,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-23 23:32:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 963. [2019-11-23 23:32:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1224 transitions. [2019-11-23 23:32:46,916 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1224 transitions. Word has length 118 [2019-11-23 23:32:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:46,917 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1224 transitions. [2019-11-23 23:32:46,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1224 transitions. [2019-11-23 23:32:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:32:46,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:46,920 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:46,920 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1692461447, now seen corresponding path program 1 times [2019-11-23 23:32:46,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:46,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676054481] [2019-11-23 23:32:46,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:46,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676054481] [2019-11-23 23:32:46,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:46,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693505648] [2019-11-23 23:32:46,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:46,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:46,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:46,981 INFO L87 Difference]: Start difference. First operand 963 states and 1224 transitions. Second operand 3 states. [2019-11-23 23:32:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:47,306 INFO L93 Difference]: Finished difference Result 2005 states and 2525 transitions. [2019-11-23 23:32:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:47,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 23:32:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:47,311 INFO L225 Difference]: With dead ends: 2005 [2019-11-23 23:32:47,311 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:47,314 INFO L630 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 [2019-11-23 23:32:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-23 23:32:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1236 transitions. [2019-11-23 23:32:47,343 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1236 transitions. Word has length 131 [2019-11-23 23:32:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:47,343 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1236 transitions. [2019-11-23 23:32:47,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1236 transitions. [2019-11-23 23:32:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-23 23:32:47,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:47,349 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:47,349 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1881549878, now seen corresponding path program 1 times [2019-11-23 23:32:47,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:47,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214481854] [2019-11-23 23:32:47,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-23 23:32:47,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214481854] [2019-11-23 23:32:47,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550800252] [2019-11-23 23:32:47,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:47,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:47,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 23:32:47,803 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-23 23:32:47,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:47,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-11-23 23:32:47,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854042157] [2019-11-23 23:32:47,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:47,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:47,888 INFO L87 Difference]: Start difference. First operand 1043 states and 1236 transitions. Second operand 4 states. [2019-11-23 23:32:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:48,415 INFO L93 Difference]: Finished difference Result 2563 states and 3051 transitions. [2019-11-23 23:32:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:48,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-11-23 23:32:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:48,416 INFO L225 Difference]: With dead ends: 2563 [2019-11-23 23:32:48,417 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:48,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:48,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-11-23 23:32:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:48,421 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:48,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:48,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:48,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:48,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:49,039 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-11-23 23:32:49,259 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-11-23 23:32:49,262 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:49,262 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:49,263 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:49,263 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:49,263 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:49,263 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:49,263 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:49,263 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:49,264 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:49,264 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:49,264 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:49,264 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:49,264 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:49,265 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:49,265 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:49,265 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:49,265 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:49,265 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:49,266 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:49,267 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-11-23 23:32:49,268 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:49,269 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:49,269 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:49,269 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:49,269 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1))) (let ((.cse2 (not .cse7)) (.cse1 (= ~a11~0 1)) (.cse6 (= ~a19~0 1)) (.cse0 (= ~a28~0 9)) (.cse4 (<= ~a19~0 0)) (.cse5 (= ~a17~0 8)) (.cse3 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and .cse2 .cse1 .cse3) (and .cse4 .cse2 .cse5) (and .cse6 .cse1) (and .cse6 .cse7) (and (<= ~a28~0 8) .cse6) (and .cse0 .cse4) (and .cse5 .cse3)))) [2019-11-23 23:32:49,269 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:49,270 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:49,270 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:49,270 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:49,270 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:49,270 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:49,270 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:49,271 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:49,271 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:49,271 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:49,271 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1))) (let ((.cse2 (not .cse7)) (.cse1 (= ~a11~0 1)) (.cse6 (= ~a19~0 1)) (.cse0 (= ~a28~0 9)) (.cse4 (<= ~a19~0 0)) (.cse5 (= ~a17~0 8)) (.cse3 (not (= ~a28~0 11)))) (or (and .cse0 .cse1) (and .cse2 .cse1 .cse3) (and .cse4 .cse2 .cse5) (and .cse6 .cse1) (and .cse6 .cse7) (and (<= ~a28~0 8) .cse6) (and .cse0 .cse4) (and .cse5 .cse3)))) [2019-11-23 23:32:49,271 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:49,271 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:49,272 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:49,273 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:49,274 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:49,275 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:49,275 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:49,275 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:49,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:49 BoogieIcfgContainer [2019-11-23 23:32:49,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:49,293 INFO L168 Benchmark]: Toolchain (without parser) took 10461.17 ms. Allocated memory was 138.4 MB in the beginning and 393.2 MB in the end (delta: 254.8 MB). Free memory was 101.7 MB in the beginning and 128.2 MB in the end (delta: -26.5 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,294 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.06 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 166.4 MB in the end (delta: -64.9 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.22 ms. Allocated memory is still 202.4 MB. Free memory was 166.4 MB in the beginning and 160.7 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,296 INFO L168 Benchmark]: Boogie Preprocessor took 79.49 ms. Allocated memory is still 202.4 MB. Free memory was 160.7 MB in the beginning and 155.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,297 INFO L168 Benchmark]: RCFGBuilder took 2045.46 ms. Allocated memory was 202.4 MB in the beginning and 252.2 MB in the end (delta: 49.8 MB). Free memory was 155.7 MB in the beginning and 191.9 MB in the end (delta: -36.1 MB). Peak memory consumption was 112.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,298 INFO L168 Benchmark]: TraceAbstraction took 7557.24 ms. Allocated memory was 252.2 MB in the beginning and 393.2 MB in the end (delta: 141.0 MB). Free memory was 190.0 MB in the beginning and 128.2 MB in the end (delta: 61.8 MB). Peak memory consumption was 202.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:49,303 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 690.06 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.5 MB in the beginning and 166.4 MB in the end (delta: -64.9 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.22 ms. Allocated memory is still 202.4 MB. Free memory was 166.4 MB in the beginning and 160.7 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.49 ms. Allocated memory is still 202.4 MB. Free memory was 160.7 MB in the beginning and 155.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2045.46 ms. Allocated memory was 202.4 MB in the beginning and 252.2 MB in the end (delta: 49.8 MB). Free memory was 155.7 MB in the beginning and 191.9 MB in the end (delta: -36.1 MB). Peak memory consumption was 112.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7557.24 ms. Allocated memory was 252.2 MB in the beginning and 393.2 MB in the end (delta: 141.0 MB). Free memory was 190.0 MB in the beginning and 128.2 MB in the end (delta: 61.8 MB). Peak memory consumption was 202.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((a28 == 9 && a11 == 1) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || (a19 == 1 && a11 == 1)) || (a19 == 1 && a25 == 1)) || (a28 <= 8 && a19 == 1)) || (a28 == 9 && a19 <= 0)) || (a17 == 8 && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((a28 == 9 && a11 == 1) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || (a19 == 1 && a11 == 1)) || (a19 == 1 && a25 == 1)) || (a28 <= 8 && a19 == 1)) || (a28 == 9 && a19 <= 0)) || (a17 == 8 && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 587 SDtfs, 856 SDslu, 105 SDs, 0 SdLazy, 2864 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 454 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 135 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1120 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 712 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1397 ConstructedInterpolants, 0 QuantifiedInterpolants, 459999 SizeOfPredicates, 2 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1041 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...