./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label50_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/Problem14_label50_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 84719fa7c370f946c431f46475b54ba30487ebc7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:27:54,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:27:54,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:27:54,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:27:54,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:27:54,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:27:54,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:27:54,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:27:54,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:27:54,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:27:54,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:27:54,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:27:54,526 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:27:54,526 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:27:54,528 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:27:54,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:27:54,530 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:27:54,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:27:54,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:27:54,536 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:27:54,537 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:27:54,539 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:27:54,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:27:54,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:27:54,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:27:54,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:27:54,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:27:54,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:27:54,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:27:54,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:27:54,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:27:54,549 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:27:54,549 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:27:54,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:27:54,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:27:54,552 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:27:54,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:27:54,572 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:27:54,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:27:54,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:27:54,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:27:54,576 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:27:54,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:27:54,577 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:27:54,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:27:54,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:27:54,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:27:54,580 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:27:54,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:27:54,580 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:27:54,580 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:27:54,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:27:54,581 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:27:54,581 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:27:54,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:27:54,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:27:54,582 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:27:54,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:27:54,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:27:54,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:27:54,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:27:54,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:27:54,585 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:27:54,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:27:54,585 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:27:54,585 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 -> 84719fa7c370f946c431f46475b54ba30487ebc7 [2019-01-12 04:27:54,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:27:54,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:27:54,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:27:54,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:27:54,662 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:27:54,664 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2019-01-12 04:27:54,723 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d264201ec/bb96248744264544b190716ea566d765/FLAGf2e775d90 [2019-01-12 04:27:55,306 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:27:55,307 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label50_true-unreach-call_false-termination.c [2019-01-12 04:27:55,325 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d264201ec/bb96248744264544b190716ea566d765/FLAGf2e775d90 [2019-01-12 04:27:55,536 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d264201ec/bb96248744264544b190716ea566d765 [2019-01-12 04:27:55,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:27:55,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:27:55,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:27:55,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:27:55,546 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:27:55,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:27:55" (1/1) ... [2019-01-12 04:27:55,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40714713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:55, skipping insertion in model container [2019-01-12 04:27:55,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:27:55" (1/1) ... [2019-01-12 04:27:55,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:27:55,622 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:27:56,056 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:27:56,061 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:27:56,256 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:27:56,275 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:27:56,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56 WrapperNode [2019-01-12 04:27:56,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:27:56,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:27:56,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:27:56,277 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:27:56,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:27:56,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:27:56,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:27:56,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:27:56,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (1/1) ... [2019-01-12 04:27:56,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:27:56,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:27:56,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:27:56,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:27:56,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (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 04:27:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:27:56,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:28:00,352 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:28:00,353 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 04:28:00,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:00 BoogieIcfgContainer [2019-01-12 04:28:00,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:28:00,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:28:00,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:28:00,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:28:00,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:27:55" (1/3) ... [2019-01-12 04:28:00,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790765c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:28:00, skipping insertion in model container [2019-01-12 04:28:00,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:56" (2/3) ... [2019-01-12 04:28:00,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790765c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:28:00, skipping insertion in model container [2019-01-12 04:28:00,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:00" (3/3) ... [2019-01-12 04:28:00,364 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label50_true-unreach-call_false-termination.c [2019-01-12 04:28:00,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:28:00,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:28:00,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:28:00,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:28:00,436 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:28:00,437 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:28:00,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:28:00,437 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:28:00,437 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:28:00,438 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:28:00,438 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:28:00,438 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:28:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 04:28:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 04:28:00,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:00,471 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] [2019-01-12 04:28:00,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-01-12 04:28:00,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:00,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:00,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:00,884 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 04:28:00,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:00,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:00,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:00,906 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-01-12 04:28:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:03,780 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-01-12 04:28:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:03,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-12 04:28:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:03,802 INFO L225 Difference]: With dead ends: 866 [2019-01-12 04:28:03,802 INFO L226 Difference]: Without dead ends: 538 [2019-01-12 04:28:03,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-12 04:28:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-01-12 04:28:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-01-12 04:28:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-01-12 04:28:03,886 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 37 [2019-01-12 04:28:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:03,887 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-01-12 04:28:03,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-01-12 04:28:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-12 04:28:03,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:03,900 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 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 04:28:03,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -46764254, now seen corresponding path program 1 times [2019-01-12 04:28:03,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:03,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:03,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:04,728 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-01-12 04:28:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:28:04,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:04,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:04,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:04,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:04,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:04,820 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2019-01-12 04:28:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:08,209 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2019-01-12 04:28:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:08,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-01-12 04:28:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:08,225 INFO L225 Difference]: With dead ends: 1964 [2019-01-12 04:28:08,225 INFO L226 Difference]: Without dead ends: 1428 [2019-01-12 04:28:08,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-01-12 04:28:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-01-12 04:28:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-01-12 04:28:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2019-01-12 04:28:08,297 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 145 [2019-01-12 04:28:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:08,300 INFO L480 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2019-01-12 04:28:08,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2019-01-12 04:28:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-12 04:28:08,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:08,318 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, 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, 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] [2019-01-12 04:28:08,318 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -215109710, now seen corresponding path program 1 times [2019-01-12 04:28:08,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:08,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:08,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:08,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:08,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-12 04:28:08,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:08,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:08,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:08,541 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2019-01-12 04:28:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:11,193 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2019-01-12 04:28:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:11,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-01-12 04:28:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:11,208 INFO L225 Difference]: With dead ends: 3922 [2019-01-12 04:28:11,209 INFO L226 Difference]: Without dead ends: 2674 [2019-01-12 04:28:11,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-01-12 04:28:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-01-12 04:28:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-01-12 04:28:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2019-01-12 04:28:11,266 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 211 [2019-01-12 04:28:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:11,266 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2019-01-12 04:28:11,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2019-01-12 04:28:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-12 04:28:11,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:11,271 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, 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, 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] [2019-01-12 04:28:11,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash -525795883, now seen corresponding path program 1 times [2019-01-12 04:28:11,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:11,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:11,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 04:28:11,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:11,614 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 04:28:11,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:11,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 04:28:11,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:11,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:28:11,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:11,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:11,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:11,897 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 6 states. [2019-01-12 04:28:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:18,190 INFO L93 Difference]: Finished difference Result 5313 states and 6711 transitions. [2019-01-12 04:28:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:18,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-01-12 04:28:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:18,207 INFO L225 Difference]: With dead ends: 5313 [2019-01-12 04:28:18,207 INFO L226 Difference]: Without dead ends: 3030 [2019-01-12 04:28:18,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-01-12 04:28:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2318. [2019-01-12 04:28:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-01-12 04:28:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2504 transitions. [2019-01-12 04:28:18,268 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2504 transitions. Word has length 225 [2019-01-12 04:28:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:18,270 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2504 transitions. [2019-01-12 04:28:18,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2504 transitions. [2019-01-12 04:28:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-12 04:28:18,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:18,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2019-01-12 04:28:18,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:18,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1552183001, now seen corresponding path program 1 times [2019-01-12 04:28:18,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:18,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:18,927 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-12 04:28:19,268 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-12 04:28:19,694 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2019-01-12 04:28:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-01-12 04:28:20,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:20,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:28:20,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:20,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-12 04:28:20,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:20,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:28:20,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:28:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:28:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:20,248 INFO L87 Difference]: Start difference. First operand 2318 states and 2504 transitions. Second operand 7 states. [2019-01-12 04:28:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:26,050 INFO L93 Difference]: Finished difference Result 6242 states and 6731 transitions. [2019-01-12 04:28:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:26,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 341 [2019-01-12 04:28:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:26,072 INFO L225 Difference]: With dead ends: 6242 [2019-01-12 04:28:26,073 INFO L226 Difference]: Without dead ends: 3926 [2019-01-12 04:28:26,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2019-01-12 04:28:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3386. [2019-01-12 04:28:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-12 04:28:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3618 transitions. [2019-01-12 04:28:26,150 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3618 transitions. Word has length 341 [2019-01-12 04:28:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:26,152 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3618 transitions. [2019-01-12 04:28:26,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:28:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3618 transitions. [2019-01-12 04:28:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-01-12 04:28:26,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:26,166 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:26,166 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1290932012, now seen corresponding path program 1 times [2019-01-12 04:28:26,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:26,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:26,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:26,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:26,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2019-01-12 04:28:26,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:26,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:26,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:26,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:26,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:26,705 INFO L87 Difference]: Start difference. First operand 3386 states and 3618 transitions. Second operand 4 states. [2019-01-12 04:28:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:28,097 INFO L93 Difference]: Finished difference Result 8194 states and 8836 transitions. [2019-01-12 04:28:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:28,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 507 [2019-01-12 04:28:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:28,123 INFO L225 Difference]: With dead ends: 8194 [2019-01-12 04:28:28,123 INFO L226 Difference]: Without dead ends: 4810 [2019-01-12 04:28:28,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-01-12 04:28:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4454. [2019-01-12 04:28:28,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:28:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4750 transitions. [2019-01-12 04:28:28,220 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4750 transitions. Word has length 507 [2019-01-12 04:28:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:28,221 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4750 transitions. [2019-01-12 04:28:28,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4750 transitions. [2019-01-12 04:28:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-01-12 04:28:28,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:28,239 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:28,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1402588258, now seen corresponding path program 1 times [2019-01-12 04:28:28,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:28,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:28,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:28,826 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-01-12 04:28:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 773 proven. 130 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-01-12 04:28:29,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:29,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:28:29,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:29,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:28:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2019-01-12 04:28:29,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:28:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:28:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:28:29,893 INFO L87 Difference]: Start difference. First operand 4454 states and 4750 transitions. Second operand 14 states. [2019-01-12 04:28:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:32,801 INFO L93 Difference]: Finished difference Result 9193 states and 9786 transitions. [2019-01-12 04:28:32,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 04:28:32,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 540 [2019-01-12 04:28:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:32,818 INFO L225 Difference]: With dead ends: 9193 [2019-01-12 04:28:32,818 INFO L226 Difference]: Without dead ends: 4460 [2019-01-12 04:28:32,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-01-12 04:28:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-01-12 04:28:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3386. [2019-01-12 04:28:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-12 04:28:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3548 transitions. [2019-01-12 04:28:32,888 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3548 transitions. Word has length 540 [2019-01-12 04:28:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3548 transitions. [2019-01-12 04:28:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:28:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3548 transitions. [2019-01-12 04:28:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2019-01-12 04:28:32,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:32,903 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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 04:28:32,903 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash -685925002, now seen corresponding path program 1 times [2019-01-12 04:28:32,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:32,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:32,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 1521 proven. 0 refuted. 0 times theorem prover too weak. 822 trivial. 0 not checked. [2019-01-12 04:28:33,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:33,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:33,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:33,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:33,661 INFO L87 Difference]: Start difference. First operand 3386 states and 3548 transitions. Second operand 4 states. [2019-01-12 04:28:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:34,815 INFO L93 Difference]: Finished difference Result 7660 states and 8078 transitions. [2019-01-12 04:28:34,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:34,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 878 [2019-01-12 04:28:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:34,830 INFO L225 Difference]: With dead ends: 7660 [2019-01-12 04:28:34,830 INFO L226 Difference]: Without dead ends: 4276 [2019-01-12 04:28:34,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-01-12 04:28:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-01-12 04:28:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:28:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4292 transitions. [2019-01-12 04:28:34,894 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4292 transitions. Word has length 878 [2019-01-12 04:28:34,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:34,896 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4292 transitions. [2019-01-12 04:28:34,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4292 transitions. [2019-01-12 04:28:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2019-01-12 04:28:34,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:34,910 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:34,911 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1394762747, now seen corresponding path program 1 times [2019-01-12 04:28:34,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:34,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2917 backedges. 1982 proven. 199 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-01-12 04:28:36,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:36,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:28:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:36,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2917 backedges. 1889 proven. 93 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2019-01-12 04:28:38,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:38,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-01-12 04:28:38,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:38,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:38,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:38,129 INFO L87 Difference]: Start difference. First operand 4098 states and 4292 transitions. Second operand 8 states. [2019-01-12 04:28:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:39,918 INFO L93 Difference]: Finished difference Result 10230 states and 10674 transitions. [2019-01-12 04:28:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:28:39,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 971 [2019-01-12 04:28:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:39,943 INFO L225 Difference]: With dead ends: 10230 [2019-01-12 04:28:39,943 INFO L226 Difference]: Without dead ends: 6312 [2019-01-12 04:28:39,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2019-01-12 04:28:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 4454. [2019-01-12 04:28:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-01-12 04:28:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4636 transitions. [2019-01-12 04:28:40,028 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4636 transitions. Word has length 971 [2019-01-12 04:28:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:40,029 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4636 transitions. [2019-01-12 04:28:40,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4636 transitions. [2019-01-12 04:28:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2019-01-12 04:28:40,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:40,045 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:40,045 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 659097908, now seen corresponding path program 1 times [2019-01-12 04:28:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:40,922 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:28:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3560 backedges. 1091 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-01-12 04:28:41,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:41,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:41,631 INFO L87 Difference]: Start difference. First operand 4454 states and 4636 transitions. Second operand 4 states. [2019-01-12 04:28:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:42,696 INFO L93 Difference]: Finished difference Result 9262 states and 9642 transitions. [2019-01-12 04:28:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:42,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1048 [2019-01-12 04:28:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:42,710 INFO L225 Difference]: With dead ends: 9262 [2019-01-12 04:28:42,710 INFO L226 Difference]: Without dead ends: 4810 [2019-01-12 04:28:42,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-01-12 04:28:42,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4098. [2019-01-12 04:28:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:28:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4209 transitions. [2019-01-12 04:28:42,777 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4209 transitions. Word has length 1048 [2019-01-12 04:28:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:42,778 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4209 transitions. [2019-01-12 04:28:42,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4209 transitions. [2019-01-12 04:28:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2019-01-12 04:28:42,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:42,801 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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] [2019-01-12 04:28:42,801 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:42,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1358554948, now seen corresponding path program 1 times [2019-01-12 04:28:42,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:42,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:42,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:42,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:43,475 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 04:28:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3797 backedges. 2459 proven. 0 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2019-01-12 04:28:43,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:43,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:43,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:28:43,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:28:43,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:43,988 INFO L87 Difference]: Start difference. First operand 4098 states and 4209 transitions. Second operand 5 states. [2019-01-12 04:28:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:45,398 INFO L93 Difference]: Finished difference Result 9796 states and 10053 transitions. [2019-01-12 04:28:45,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:28:45,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1096 [2019-01-12 04:28:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:45,412 INFO L225 Difference]: With dead ends: 9796 [2019-01-12 04:28:45,412 INFO L226 Difference]: Without dead ends: 5878 [2019-01-12 04:28:45,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-01-12 04:28:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 4632. [2019-01-12 04:28:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-01-12 04:28:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4749 transitions. [2019-01-12 04:28:45,496 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4749 transitions. Word has length 1096 [2019-01-12 04:28:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:45,499 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4749 transitions. [2019-01-12 04:28:45,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:28:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4749 transitions. [2019-01-12 04:28:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1436 [2019-01-12 04:28:45,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:45,537 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:45,538 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1286404688, now seen corresponding path program 1 times [2019-01-12 04:28:45,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:45,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:45,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6129 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 5745 trivial. 0 not checked. [2019-01-12 04:28:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:47,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:47,210 INFO L87 Difference]: Start difference. First operand 4632 states and 4749 transitions. Second operand 4 states. [2019-01-12 04:28:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:48,569 INFO L93 Difference]: Finished difference Result 10508 states and 10766 transitions. [2019-01-12 04:28:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:48,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1435 [2019-01-12 04:28:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:48,582 INFO L225 Difference]: With dead ends: 10508 [2019-01-12 04:28:48,582 INFO L226 Difference]: Without dead ends: 5166 [2019-01-12 04:28:48,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-01-12 04:28:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4276. [2019-01-12 04:28:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-01-12 04:28:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4367 transitions. [2019-01-12 04:28:48,654 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4367 transitions. Word has length 1435 [2019-01-12 04:28:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:48,655 INFO L480 AbstractCegarLoop]: Abstraction has 4276 states and 4367 transitions. [2019-01-12 04:28:48,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4367 transitions. [2019-01-12 04:28:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1634 [2019-01-12 04:28:48,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:48,684 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:48,684 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2052479464, now seen corresponding path program 1 times [2019-01-12 04:28:48,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:48,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:48,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:48,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8500 backedges. 3486 proven. 438 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2019-01-12 04:28:50,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:50,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:28:50,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:51,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8500 backedges. 3556 proven. 368 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2019-01-12 04:28:53,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:53,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-12 04:28:53,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:28:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:28:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:28:53,360 INFO L87 Difference]: Start difference. First operand 4276 states and 4367 transitions. Second operand 9 states. [2019-01-12 04:28:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:59,338 INFO L93 Difference]: Finished difference Result 10152 states and 10374 transitions. [2019-01-12 04:28:59,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:28:59,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1633 [2019-01-12 04:28:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:59,353 INFO L225 Difference]: With dead ends: 10152 [2019-01-12 04:28:59,353 INFO L226 Difference]: Without dead ends: 6056 [2019-01-12 04:28:59,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1649 GetRequests, 1636 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 04:28:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-01-12 04:28:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 4988. [2019-01-12 04:28:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-01-12 04:28:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5086 transitions. [2019-01-12 04:28:59,439 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5086 transitions. Word has length 1633 [2019-01-12 04:28:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:59,441 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5086 transitions. [2019-01-12 04:28:59,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:28:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5086 transitions. [2019-01-12 04:28:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1807 [2019-01-12 04:28:59,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:59,479 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:59,479 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 334826005, now seen corresponding path program 1 times [2019-01-12 04:28:59,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:59,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:59,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10109 backedges. 4347 proven. 0 refuted. 0 times theorem prover too weak. 5762 trivial. 0 not checked. [2019-01-12 04:29:01,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:01,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:01,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:01,285 INFO L87 Difference]: Start difference. First operand 4988 states and 5086 transitions. Second operand 4 states. [2019-01-12 04:29:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:02,328 INFO L93 Difference]: Finished difference Result 10684 states and 10864 transitions. [2019-01-12 04:29:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:02,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1806 [2019-01-12 04:29:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:02,331 INFO L225 Difference]: With dead ends: 10684 [2019-01-12 04:29:02,331 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:29:02,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:29:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:29:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:29:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:29:02,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1806 [2019-01-12 04:29:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:29:02,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:29:02,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:29:02,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:29:02,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:02,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:02,846 WARN L181 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 238 [2019-01-12 04:29:02,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:03,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:03,301 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 238 [2019-01-12 04:29:07,595 WARN L181 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 227 DAG size of output: 110 [2019-01-12 04:29:09,962 WARN L181 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 227 DAG size of output: 110 [2019-01-12 04:29:09,986 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-01-12 04:29:09,986 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-01-12 04:29:09,986 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,986 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,986 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,987 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-01-12 04:29:09,988 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-01-12 04:29:09,991 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:29:09,992 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:29:09,993 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:29:09,995 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:29:09,996 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-01-12 04:29:09,997 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-01-12 04:29:09,998 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-01-12 04:29:09,999 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-01-12 04:29:10,000 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,001 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-01-12 04:29:10,002 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,003 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-01-12 04:29:10,004 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:29:10,005 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-01-12 04:29:10,006 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:29:10,007 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:29:10,007 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-01-12 04:29:10,007 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-01-12 04:29:10,007 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-01-12 04:29:10,007 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,007 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse15 (= ~a21~0 10))) (let ((.cse3 (not (= 7 ~a21~0))) (.cse4 (<= ~a15~0 8)) (.cse7 (not .cse15)) (.cse19 (= ~a15~0 8)) (.cse6 (= ~a24~0 1))) (let ((.cse5 (or (< 11 ~a12~0) (and .cse19 .cse6))) (.cse20 (= ~a21~0 8)) (.cse29 (and .cse3 .cse6 .cse4 .cse7))) (let ((.cse2 (= ~a15~0 5)) (.cse16 (<= ~a12~0 11)) (.cse28 (+ ~a12~0 43)) (.cse13 (and .cse20 .cse29)) (.cse1 (and .cse5 .cse29)) (.cse25 (< 80 ~a12~0))) (let ((.cse10 (or (and .cse13 .cse25) (and .cse1 .cse25 (= ~a21~0 9)))) (.cse0 (<= ~a12~0 73282)) (.cse17 (< 0 .cse28)) (.cse11 (not .cse19)) (.cse9 (= ~a21~0 7)) (.cse24 (<= 9 ~a15~0)) (.cse12 (= ~a15~0 7)) (.cse23 (= ~a21~0 6)) (.cse14 (and .cse6 .cse15 .cse4)) (.cse8 (<= ~a21~0 6)) (.cse21 (<= (+ ~a12~0 49) 0)) (.cse26 (<= .cse28 0)) (.cse18 (and (not .cse2) .cse16 .cse4)) (.cse22 (not (= 7 ~a15~0)))) (or (and .cse0 .cse1 .cse2) (and (and (<= ~a12~0 80) .cse3 .cse4) .cse5 .cse6 .cse7) (and (<= ~a12~0 95434) (<= 95381 ~a12~0) .cse6 .cse8) (and (<= (+ ~a12~0 460233) 0) .cse6 .cse9 .cse4) (and .cse10 .cse11) (and .cse12 .cse13) (and .cse14 .cse2) (and .cse10 .cse0) (and .cse6 .cse15 .cse16 .cse17) (and (and .cse18 .cse19 .cse6) .cse17) (and .cse6 .cse20 .cse16 .cse17) (and (and (and .cse4 .cse21 .cse8) .cse22) .cse11) (and .cse3 .cse18 .cse22 .cse6 .cse7) (and .cse13 .cse2) (and .cse6 .cse20 (<= ~a12~0 72) (<= 19 ~a12~0)) (and .cse6 .cse2 .cse9) (and (not .cse23) .cse6 .cse24 .cse25) (and .cse26 .cse6 .cse24 .cse15) (and .cse12 .cse14) (and .cse23 .cse6 .cse4) (and .cse14 .cse25) (and .cse5 (and .cse6 .cse4 .cse8)) (and .cse19 .cse6 .cse21) (and .cse6 .cse20 (<= (+ ~a12~0 526767) 0)) (and .cse18 .cse6 .cse8) (and (let ((.cse27 (or (and .cse4 .cse21) (and .cse26 .cse18)))) (or (and .cse27 .cse3 .cse6 .cse7) (and (and .cse27 .cse19) .cse6 .cse15))) .cse22))))))) [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-01-12 04:29:10,008 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-01-12 04:29:10,010 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,011 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,012 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 04:29:10,012 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,012 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-01-12 04:29:10,012 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse15 (= ~a21~0 10))) (let ((.cse3 (not (= 7 ~a21~0))) (.cse4 (<= ~a15~0 8)) (.cse7 (not .cse15)) (.cse19 (= ~a15~0 8)) (.cse6 (= ~a24~0 1))) (let ((.cse5 (or (< 11 ~a12~0) (and .cse19 .cse6))) (.cse20 (= ~a21~0 8)) (.cse29 (and .cse3 .cse6 .cse4 .cse7))) (let ((.cse2 (= ~a15~0 5)) (.cse16 (<= ~a12~0 11)) (.cse28 (+ ~a12~0 43)) (.cse13 (and .cse20 .cse29)) (.cse1 (and .cse5 .cse29)) (.cse25 (< 80 ~a12~0))) (let ((.cse10 (or (and .cse13 .cse25) (and .cse1 .cse25 (= ~a21~0 9)))) (.cse0 (<= ~a12~0 73282)) (.cse17 (< 0 .cse28)) (.cse11 (not .cse19)) (.cse9 (= ~a21~0 7)) (.cse24 (<= 9 ~a15~0)) (.cse12 (= ~a15~0 7)) (.cse23 (= ~a21~0 6)) (.cse14 (and .cse6 .cse15 .cse4)) (.cse8 (<= ~a21~0 6)) (.cse21 (<= (+ ~a12~0 49) 0)) (.cse26 (<= .cse28 0)) (.cse18 (and (not .cse2) .cse16 .cse4)) (.cse22 (not (= 7 ~a15~0)))) (or (and .cse0 .cse1 .cse2) (and (and (<= ~a12~0 80) .cse3 .cse4) .cse5 .cse6 .cse7) (and (<= ~a12~0 95434) (<= 95381 ~a12~0) .cse6 .cse8) (and (<= (+ ~a12~0 460233) 0) .cse6 .cse9 .cse4) (and .cse10 .cse11) (and .cse12 .cse13) (and .cse14 .cse2) (and .cse10 .cse0) (and .cse6 .cse15 .cse16 .cse17) (and (and .cse18 .cse19 .cse6) .cse17) (and .cse6 .cse20 .cse16 .cse17) (and (and (and .cse4 .cse21 .cse8) .cse22) .cse11) (and .cse3 .cse18 .cse22 .cse6 .cse7) (and .cse13 .cse2) (and .cse6 .cse20 (<= ~a12~0 72) (<= 19 ~a12~0)) (and .cse6 .cse2 .cse9) (and (not .cse23) .cse6 .cse24 .cse25) (and .cse26 .cse6 .cse24 .cse15) (and .cse12 .cse14) (and .cse23 .cse6 .cse4) (and .cse14 .cse25) (and .cse5 (and .cse6 .cse4 .cse8)) (and .cse19 .cse6 .cse21) (and .cse6 .cse20 (<= (+ ~a12~0 526767) 0)) (and .cse18 .cse6 .cse8) (and (let ((.cse27 (or (and .cse4 .cse21) (and .cse26 .cse18)))) (or (and .cse27 .cse3 .cse6 .cse7) (and (and .cse27 .cse19) .cse6 .cse15))) .cse22))))))) [2019-01-12 04:29:10,012 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-01-12 04:29:10,013 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,015 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,016 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,017 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,018 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-01-12 04:29:10,018 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-01-12 04:29:10,021 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:29:10,022 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-01-12 04:29:10,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:29:10 BoogieIcfgContainer [2019-01-12 04:29:10,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:29:10,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:29:10,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:29:10,099 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:29:10,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:00" (3/4) ... [2019-01-12 04:29:10,110 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:29:10,161 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 04:29:10,165 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:29:10,410 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:29:10,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:29:10,417 INFO L168 Benchmark]: Toolchain (without parser) took 74876.96 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 943.3 MB in the beginning and 1.9 GB in the end (delta: -984.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-12 04:29:10,418 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:29:10,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.94 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 904.4 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:10,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 904.4 MB in the beginning and 1.1 GB in the end (delta: -221.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:10,419 INFO L168 Benchmark]: Boogie Preprocessor took 92.91 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 04:29:10,419 INFO L168 Benchmark]: RCFGBuilder took 3781.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.4 MB in the end (delta: 131.4 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:10,419 INFO L168 Benchmark]: TraceAbstraction took 69742.78 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 987.4 MB in the beginning and 2.0 GB in the end (delta: -996.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-12 04:29:10,420 INFO L168 Benchmark]: Witness Printer took 317.09 ms. Allocated memory is still 3.7 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:29:10,422 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 733.94 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 904.4 MB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 203.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 904.4 MB in the beginning and 1.1 GB in the end (delta: -221.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.91 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 3781.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.4 MB in the end (delta: 131.4 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69742.78 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 987.4 MB in the beginning and 2.0 GB in the end (delta: -996.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 317.09 ms. Allocated memory is still 3.7 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a12 <= 73282 && (11 < a12 || (a15 == 8 && a24 == 1)) && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && a15 == 5) || (((((a12 <= 80 && !(7 == a21)) && a15 <= 8) && (11 < a12 || (a15 == 8 && a24 == 1))) && a24 == 1) && !(a21 == 10))) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || (((a12 + 460233 <= 0 && a24 == 1) && a21 == 7) && a15 <= 8)) || ((((a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) || ((((11 < a12 || (a15 == 8 && a24 == 1)) && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) && a21 == 9)) && !(a15 == 8))) || (a15 == 7 && a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && a15 == 5)) || ((((a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) || ((((11 < a12 || (a15 == 8 && a24 == 1)) && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) && a21 == 9)) && a12 <= 73282)) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 < a12 + 43)) || (((((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a15 == 8) && a24 == 1) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) && !(7 == a15)) && !(a15 == 8))) || ((((!(7 == a21) && (!(a15 == 5) && a12 <= 11) && a15 <= 8) && !(7 == a15)) && a24 == 1) && !(a21 == 10))) || ((a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && a15 == 5)) || (((a24 == 1 && a21 == 8) && a12 <= 72) && 19 <= a12)) || ((a24 == 1 && a15 == 5) && a21 == 7)) || (((!(a21 == 6) && a24 == 1) && 9 <= a15) && 80 < a12)) || (((a12 + 43 <= 0 && a24 == 1) && 9 <= a15) && a21 == 10)) || (a15 == 7 && (a24 == 1 && a21 == 10) && a15 <= 8)) || ((a21 == 6 && a24 == 1) && a15 <= 8)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((11 < a12 || (a15 == 8 && a24 == 1)) && (a24 == 1 && a15 <= 8) && a21 <= 6)) || ((a15 == 8 && a24 == 1) && a12 + 49 <= 0)) || ((a24 == 1 && a21 == 8) && a12 + 526767 <= 0)) || ((((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && a21 <= 6)) || (((((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && !(7 == a21)) && a24 == 1) && !(a21 == 10)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a15 == 8) && a24 == 1) && a21 == 10)) && !(7 == a15)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a12 <= 73282 && (11 < a12 || (a15 == 8 && a24 == 1)) && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && a15 == 5) || (((((a12 <= 80 && !(7 == a21)) && a15 <= 8) && (11 < a12 || (a15 == 8 && a24 == 1))) && a24 == 1) && !(a21 == 10))) || (((a12 <= 95434 && 95381 <= a12) && a24 == 1) && a21 <= 6)) || (((a12 + 460233 <= 0 && a24 == 1) && a21 == 7) && a15 <= 8)) || ((((a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) || ((((11 < a12 || (a15 == 8 && a24 == 1)) && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) && a21 == 9)) && !(a15 == 8))) || (a15 == 7 && a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10))) || (((a24 == 1 && a21 == 10) && a15 <= 8) && a15 == 5)) || ((((a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) || ((((11 < a12 || (a15 == 8 && a24 == 1)) && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && 80 < a12) && a21 == 9)) && a12 <= 73282)) || (((a24 == 1 && a21 == 10) && a12 <= 11) && 0 < a12 + 43)) || (((((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a15 == 8) && a24 == 1) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a15 <= 8 && a12 + 49 <= 0) && a21 <= 6) && !(7 == a15)) && !(a15 == 8))) || ((((!(7 == a21) && (!(a15 == 5) && a12 <= 11) && a15 <= 8) && !(7 == a15)) && a24 == 1) && !(a21 == 10))) || ((a21 == 8 && ((!(7 == a21) && a24 == 1) && a15 <= 8) && !(a21 == 10)) && a15 == 5)) || (((a24 == 1 && a21 == 8) && a12 <= 72) && 19 <= a12)) || ((a24 == 1 && a15 == 5) && a21 == 7)) || (((!(a21 == 6) && a24 == 1) && 9 <= a15) && 80 < a12)) || (((a12 + 43 <= 0 && a24 == 1) && 9 <= a15) && a21 == 10)) || (a15 == 7 && (a24 == 1 && a21 == 10) && a15 <= 8)) || ((a21 == 6 && a24 == 1) && a15 <= 8)) || (((a24 == 1 && a21 == 10) && a15 <= 8) && 80 < a12)) || ((11 < a12 || (a15 == 8 && a24 == 1)) && (a24 == 1 && a15 <= 8) && a21 <= 6)) || ((a15 == 8 && a24 == 1) && a12 + 49 <= 0)) || ((a24 == 1 && a21 == 8) && a12 + 526767 <= 0)) || ((((!(a15 == 5) && a12 <= 11) && a15 <= 8) && a24 == 1) && a21 <= 6)) || (((((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && !(7 == a21)) && a24 == 1) && !(a21 == 10)) || (((((a15 <= 8 && a12 + 49 <= 0) || (a12 + 43 <= 0 && (!(a15 == 5) && a12 <= 11) && a15 <= 8)) && a15 == 8) && a24 == 1) && a21 == 10)) && !(7 == a15)) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 69.5s OverallTime, 14 OverallIterations, 15 TraceHistogramMax, 39.4s AutomataDifference, 0.0s DeadEndRemovalTime, 7.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1158 SDtfs, 7094 SDslu, 345 SDs, 0 SdLazy, 23870 SolverSat, 1788 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3809 GetRequests, 3726 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=13, 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.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 8990 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 98 NumberOfFragments, 1237 HoareAnnotationTreeSize, 3 FomulaSimplifications, 26640 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 104886 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 14583 NumberOfCodeBlocks, 14583 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 14564 ConstructedInterpolants, 0 QuantifiedInterpolants, 37838914 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4599 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 51862/53098 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...