./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:50:06,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:50:06,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:50:06,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:50:06,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:50:06,530 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:50:06,531 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:50:06,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:50:06,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:50:06,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:50:06,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:50:06,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:50:06,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:50:06,539 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:50:06,541 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:50:06,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:50:06,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:50:06,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:50:06,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:50:06,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:50:06,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:50:06,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:50:06,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:50:06,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:50:06,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:50:06,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:50:06,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:50:06,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:50:06,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:50:06,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:50:06,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:50:06,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:50:06,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:50:06,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:50:06,563 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:50:06,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:50:06,564 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:50:06,579 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:50:06,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:50:06,580 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:50:06,580 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:50:06,581 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:50:06,581 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:50:06,581 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:50:06,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:50:06,582 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:50:06,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:50:06,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:50:06,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:50:06,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:50:06,583 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:50:06,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:50:06,583 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:50:06,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:50:06,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:50:06,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:50:06,585 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:50:06,585 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:50:06,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:50:06,586 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:50:06,586 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:50:06,586 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:50:06,586 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:50:06,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:50:06,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:50:06,588 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f [2019-01-12 00:50:06,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:50:06,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:50:06,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:50:06,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:50:06,640 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:50:06,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2019-01-12 00:50:06,695 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a623b078d/1d607befe11f4289bdaa27a503c22386/FLAG4812b2706 [2019-01-12 00:50:07,210 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:50:07,211 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label05_true-unreach-call_false-termination.c [2019-01-12 00:50:07,225 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a623b078d/1d607befe11f4289bdaa27a503c22386/FLAG4812b2706 [2019-01-12 00:50:07,482 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a623b078d/1d607befe11f4289bdaa27a503c22386 [2019-01-12 00:50:07,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:50:07,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:50:07,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:50:07,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:50:07,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:50:07,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:50:07" (1/1) ... [2019-01-12 00:50:07,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebf076e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:07, skipping insertion in model container [2019-01-12 00:50:07,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:50:07" (1/1) ... [2019-01-12 00:50:07,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:50:07,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:50:08,068 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:50:08,079 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:50:08,213 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:50:08,235 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:50:08,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08 WrapperNode [2019-01-12 00:50:08,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:50:08,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:50:08,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:50:08,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:50:08,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:50:08,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:50:08,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:50:08,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:50:08,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (1/1) ... [2019-01-12 00:50:08,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:50:08,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:50:08,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:50:08,492 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:50:08,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (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-01-12 00:50:08,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:50:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:50:11,707 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:50:11,708 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:50:11,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:50:11 BoogieIcfgContainer [2019-01-12 00:50:11,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:50:11,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:50:11,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:50:11,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:50:11,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:50:07" (1/3) ... [2019-01-12 00:50:11,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8c3a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:50:11, skipping insertion in model container [2019-01-12 00:50:11,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:50:08" (2/3) ... [2019-01-12 00:50:11,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8c3a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:50:11, skipping insertion in model container [2019-01-12 00:50:11,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:50:11" (3/3) ... [2019-01-12 00:50:11,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label05_true-unreach-call_false-termination.c [2019-01-12 00:50:11,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:50:11,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:50:11,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:50:11,793 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:50:11,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:50:11,794 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:50:11,794 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:50:11,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:50:11,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:50:11,795 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:50:11,795 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:50:11,795 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:50:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:50:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 00:50:11,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:11,833 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:50:11,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1877985287, now seen corresponding path program 1 times [2019-01-12 00:50:11,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:11,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:11,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:11,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:11,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:12,470 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:50:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:50:12,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:50:12,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:50:12,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:50:12,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:12,561 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:50:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:15,254 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:50:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:50:15,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 00:50:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:15,303 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:50:15,303 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:50:15,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:50:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-01-12 00:50:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 00:50:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-01-12 00:50:15,382 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 94 [2019-01-12 00:50:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-01-12 00:50:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:50:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-01-12 00:50:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 00:50:15,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:15,388 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 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-01-12 00:50:15,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1993122394, now seen corresponding path program 1 times [2019-01-12 00:50:15,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:15,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:15,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:15,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:15,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:50:15,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:15,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:50:15,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:50:15,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:50:15,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:50:15,522 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-01-12 00:50:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:16,758 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-01-12 00:50:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:50:16,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-01-12 00:50:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:16,765 INFO L225 Difference]: With dead ends: 1054 [2019-01-12 00:50:16,765 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:50:16,768 INFO L631 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-01-12 00:50:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:50:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:50:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:50:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-01-12 00:50:16,813 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 100 [2019-01-12 00:50:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:16,813 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-01-12 00:50:16,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:50:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-01-12 00:50:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-12 00:50:16,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:16,819 INFO L402 BasicCegarLoop]: trace histogram [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, 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-01-12 00:50:16,819 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:16,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2028903770, now seen corresponding path program 1 times [2019-01-12 00:50:16,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:16,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:16,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:16,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:50:16,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:16,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:16,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:16,975 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-01-12 00:50:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:18,317 INFO L93 Difference]: Finished difference Result 2102 states and 2831 transitions. [2019-01-12 00:50:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:18,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-01-12 00:50:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:18,336 INFO L225 Difference]: With dead ends: 2102 [2019-01-12 00:50:18,336 INFO L226 Difference]: Without dead ends: 1314 [2019-01-12 00:50:18,342 INFO L631 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-01-12 00:50:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-01-12 00:50:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-01-12 00:50:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-12 00:50:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2019-01-12 00:50:18,388 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 101 [2019-01-12 00:50:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:18,388 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2019-01-12 00:50:18,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2019-01-12 00:50:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 00:50:18,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:18,393 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:50:18,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:18,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1582856459, now seen corresponding path program 1 times [2019-01-12 00:50:18,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:18,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:18,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:50:18,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:18,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:18,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:18,529 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 3 states. [2019-01-12 00:50:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:19,872 INFO L93 Difference]: Finished difference Result 2364 states and 3019 transitions. [2019-01-12 00:50:19,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:19,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-01-12 00:50:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:19,881 INFO L225 Difference]: With dead ends: 2364 [2019-01-12 00:50:19,881 INFO L226 Difference]: Without dead ends: 1314 [2019-01-12 00:50:19,883 INFO L631 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-01-12 00:50:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-01-12 00:50:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-01-12 00:50:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-01-12 00:50:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1502 transitions. [2019-01-12 00:50:19,942 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1502 transitions. Word has length 128 [2019-01-12 00:50:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:19,943 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1502 transitions. [2019-01-12 00:50:19,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1502 transitions. [2019-01-12 00:50:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-12 00:50:19,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:19,953 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:50:19,953 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1986645786, now seen corresponding path program 1 times [2019-01-12 00:50:19,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:50:20,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:20,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:20,080 INFO L87 Difference]: Start difference. First operand 1183 states and 1502 transitions. Second operand 3 states. [2019-01-12 00:50:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:21,060 INFO L93 Difference]: Finished difference Result 3150 states and 3980 transitions. [2019-01-12 00:50:21,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:21,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-01-12 00:50:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:21,072 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:50:21,072 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:50:21,074 INFO L631 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-01-12 00:50:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:50:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-01-12 00:50:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:50:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2265 transitions. [2019-01-12 00:50:21,116 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2265 transitions. Word has length 152 [2019-01-12 00:50:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:21,117 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2265 transitions. [2019-01-12 00:50:21,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2265 transitions. [2019-01-12 00:50:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 00:50:21,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:21,125 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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-01-12 00:50:21,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash -27987931, now seen corresponding path program 1 times [2019-01-12 00:50:21,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:21,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:21,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:21,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-01-12 00:50:21,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:21,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:21,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:21,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:21,310 INFO L87 Difference]: Start difference. First operand 1838 states and 2265 transitions. Second operand 3 states. [2019-01-12 00:50:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:22,085 INFO L93 Difference]: Finished difference Result 3674 states and 4528 transitions. [2019-01-12 00:50:22,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:22,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-01-12 00:50:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:22,094 INFO L225 Difference]: With dead ends: 3674 [2019-01-12 00:50:22,094 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:50:22,097 INFO L631 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-01-12 00:50:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:50:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-01-12 00:50:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:50:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2110 transitions. [2019-01-12 00:50:22,133 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2110 transitions. Word has length 157 [2019-01-12 00:50:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:22,133 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2110 transitions. [2019-01-12 00:50:22,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2110 transitions. [2019-01-12 00:50:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 00:50:22,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:22,138 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:50:22,138 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:22,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:22,139 INFO L82 PathProgramCache]: Analyzing trace with hash 639923582, now seen corresponding path program 1 times [2019-01-12 00:50:22,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:22,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:22,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:22,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-12 00:50:22,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:22,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:50:22,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:22,312 INFO L87 Difference]: Start difference. First operand 1707 states and 2110 transitions. Second operand 3 states. [2019-01-12 00:50:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:23,070 INFO L93 Difference]: Finished difference Result 3543 states and 4361 transitions. [2019-01-12 00:50:23,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:23,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-01-12 00:50:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:23,080 INFO L225 Difference]: With dead ends: 3543 [2019-01-12 00:50:23,080 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:50:23,083 INFO L631 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-01-12 00:50:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:50:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-01-12 00:50:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:50:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2229 transitions. [2019-01-12 00:50:23,123 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2229 transitions. Word has length 177 [2019-01-12 00:50:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:23,123 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2229 transitions. [2019-01-12 00:50:23,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2229 transitions. [2019-01-12 00:50:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-12 00:50:23,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:23,129 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 00:50:23,129 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 502707782, now seen corresponding path program 1 times [2019-01-12 00:50:23,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-01-12 00:50:23,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:23,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 00:50:23,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:50:23,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:50:23,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:50:23,458 INFO L87 Difference]: Start difference. First operand 1838 states and 2229 transitions. Second operand 8 states. [2019-01-12 00:50:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:24,791 INFO L93 Difference]: Finished difference Result 3844 states and 4632 transitions. [2019-01-12 00:50:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 00:50:24,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-01-12 00:50:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:24,801 INFO L225 Difference]: With dead ends: 3844 [2019-01-12 00:50:24,801 INFO L226 Difference]: Without dead ends: 2008 [2019-01-12 00:50:24,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:50:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-01-12 00:50:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1838. [2019-01-12 00:50:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:50:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-01-12 00:50:24,840 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 181 [2019-01-12 00:50:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:24,840 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-01-12 00:50:24,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:50:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-01-12 00:50:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-12 00:50:24,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:24,845 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:50:24,846 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:24,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:24,846 INFO L82 PathProgramCache]: Analyzing trace with hash 997281865, now seen corresponding path program 1 times [2019-01-12 00:50:24,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:24,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:24,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:24,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:24,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 00:50:25,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:50:25,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:50:25,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:50:25,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:50:25,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:50:25,043 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-01-12 00:50:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:25,549 INFO L93 Difference]: Finished difference Result 2364 states and 2826 transitions. [2019-01-12 00:50:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:50:25,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-01-12 00:50:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:25,560 INFO L225 Difference]: With dead ends: 2364 [2019-01-12 00:50:25,561 INFO L226 Difference]: Without dead ends: 2362 [2019-01-12 00:50:25,562 INFO L631 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-01-12 00:50:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-01-12 00:50:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-01-12 00:50:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:50:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2043 transitions. [2019-01-12 00:50:25,596 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2043 transitions. Word has length 198 [2019-01-12 00:50:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:25,597 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2043 transitions. [2019-01-12 00:50:25,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:50:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2043 transitions. [2019-01-12 00:50:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-12 00:50:25,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:50:25,602 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:50:25,602 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:50:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:50:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1286042342, now seen corresponding path program 1 times [2019-01-12 00:50:25,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:50:25,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:50:25,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:25,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:25,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:50:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:25,940 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 00:50:26,253 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2019-01-12 00:50:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-12 00:50:26,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:50:26,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:50:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:50:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:50:26,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:50:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-01-12 00:50:26,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:50:26,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 00:50:26,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:50:26,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:50:26,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:50:26,770 INFO L87 Difference]: Start difference. First operand 1707 states and 2043 transitions. Second operand 7 states. [2019-01-12 00:50:28,194 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 00:50:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:50:33,310 INFO L93 Difference]: Finished difference Result 3851 states and 4626 transitions. [2019-01-12 00:50:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 00:50:33,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2019-01-12 00:50:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:50:33,312 INFO L225 Difference]: With dead ends: 3851 [2019-01-12 00:50:33,312 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:50:33,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-01-12 00:50:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:50:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:50:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:50:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:50:33,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2019-01-12 00:50:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:50:33,318 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:50:33,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:50:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:50:33,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:50:33,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:50:33,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,492 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 71 [2019-01-12 00:50:33,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:50:33,641 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 71 [2019-01-12 00:50:34,377 WARN L181 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-01-12 00:50:34,650 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,655 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:50:34,656 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:50:34,657 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:50:34,658 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,659 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:50:34,660 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:50:34,661 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (<= ~a21~0 0)) (.cse2 (= ~a20~0 1)) (.cse6 (not (= ~a7~0 1))) (.cse5 (not (= ~a16~0 6))) (.cse4 (= ~a21~0 1)) (.cse7 (not (= ~a8~0 13))) (.cse1 (= ~a12~0 8)) (.cse3 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 (and .cse3 .cse4 .cse2)) (and .cse0 .cse5 .cse3 .cse1) (and .cse6 .cse1 .cse4 .cse2) (and .cse6 .cse1 .cse4 .cse7) (and (or (and .cse6 .cse5 .cse4) (and .cse5 .cse4 .cse7)) .cse1 (not .cse3)))) [2019-01-12 00:50:34,661 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,661 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,661 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,661 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:50:34,662 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,663 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,664 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:50:34,665 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a21~0 0)) (.cse2 (= ~a20~0 1)) (.cse6 (not (= ~a7~0 1))) (.cse5 (not (= ~a16~0 6))) (.cse4 (= ~a21~0 1)) (.cse7 (not (= ~a8~0 13))) (.cse1 (= ~a12~0 8)) (.cse3 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 (and .cse3 .cse4 .cse2)) (and .cse0 .cse5 .cse3 .cse1) (and .cse6 .cse1 .cse4 .cse2) (and .cse6 .cse1 .cse4 .cse7) (and (or (and .cse6 .cse5 .cse4) (and .cse5 .cse4 .cse7)) .cse1 (not .cse3)))) [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,666 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:50:34,667 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:50:34,668 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:50:34,669 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:50:34,670 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:50:34,671 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:50:34,672 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,673 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:50:34,674 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:50:34,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:50:34 BoogieIcfgContainer [2019-01-12 00:50:34,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:50:34,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:50:34,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:50:34,700 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:50:34,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:50:11" (3/4) ... [2019-01-12 00:50:34,714 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:50:34,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:50:34,765 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:50:35,016 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:50:35,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:50:35,021 INFO L168 Benchmark]: Toolchain (without parser) took 27533.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 937.9 MB in the beginning and 816.9 MB in the end (delta: 121.1 MB). Peak memory consumption was 511.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,021 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:50:35,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.07 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 909.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 909.8 MB in the beginning and 1.1 GB in the end (delta: -223.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,022 INFO L168 Benchmark]: Boogie Preprocessor took 82.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,023 INFO L168 Benchmark]: RCFGBuilder took 3217.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,023 INFO L168 Benchmark]: TraceAbstraction took 22989.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.0 GB in the beginning and 828.0 MB in the end (delta: 187.6 MB). Peak memory consumption was 431.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,024 INFO L168 Benchmark]: Witness Printer took 316.41 ms. Allocated memory is still 1.4 GB. Free memory was 828.0 MB in the beginning and 816.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:50:35,026 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 747.07 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 909.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 172.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 909.8 MB in the beginning and 1.1 GB in the end (delta: -223.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3217.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22989.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.0 GB in the beginning and 828.0 MB in the end (delta: 187.6 MB). Peak memory consumption was 431.9 MB. Max. memory is 11.5 GB. * Witness Printer took 316.41 ms. Allocated memory is still 1.4 GB. Free memory was 828.0 MB in the beginning and 816.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: 30]: Loop Invariant Derived loop invariant: ((((((a21 <= 0 && a12 == 8) && a20 == 1) || (a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1)) || (((a21 <= 0 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && !(a8 == 13))) || (((((!(a7 == 1) && !(a16 == 6)) && a21 == 1) || ((!(a16 == 6) && a21 == 1) && !(a8 == 13))) && a12 == 8) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((a21 <= 0 && a12 == 8) && a20 == 1) || (a12 == 8 && (a17 == 1 && a21 == 1) && a20 == 1)) || (((a21 <= 0 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (((!(a7 == 1) && a12 == 8) && a21 == 1) && !(a8 == 13))) || (((((!(a7 == 1) && !(a16 == 6)) && a21 == 1) || ((!(a16 == 6) && a21 == 1) && !(a8 == 13))) && a12 == 8) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 22.8s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 398 SDtfs, 2214 SDslu, 131 SDs, 0 SdLazy, 6509 SolverSat, 1076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 70 NumberOfFragments, 203 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8160 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 786 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 712697 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1003/1073 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...