./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_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_label53_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 197209881b4fe70c7fe468e7084aa1de2f7c6240 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:28:10,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:28:10,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:28:10,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:28:10,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:28:10,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:28:10,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:28:10,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:28:10,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:28:10,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:28:10,525 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:28:10,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:28:10,527 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:28:10,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:28:10,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:28:10,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:28:10,533 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:28:10,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:28:10,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:28:10,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:28:10,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:28:10,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:28:10,560 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:28:10,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:28:10,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:28:10,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:28:10,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:28:10,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:28:10,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:28:10,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:28:10,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:28:10,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:28:10,566 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:28:10,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:28:10,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:28:10,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:28:10,569 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:28:10,589 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:28:10,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:28:10,591 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:28:10,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:28:10,593 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:28:10,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:28:10,593 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:28:10,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:28:10,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:28:10,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:28:10,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:28:10,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:28:10,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:28:10,594 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:28:10,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:28:10,595 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:28:10,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:28:10,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:28:10,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:28:10,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:28:10,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:28:10,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:28:10,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:28:10,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:28:10,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:28:10,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:28:10,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:28:10,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:28:10,599 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 -> 197209881b4fe70c7fe468e7084aa1de2f7c6240 [2019-01-12 04:28:10,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:28:10,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:28:10,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:28:10,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:28:10,680 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:28:10,681 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_true-unreach-call_false-termination.c [2019-01-12 04:28:10,736 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22c9d595/dd2a8f55c0b841b1acc21b878be83011/FLAG09732bb7e [2019-01-12 04:28:11,316 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:28:11,317 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label53_true-unreach-call_false-termination.c [2019-01-12 04:28:11,332 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22c9d595/dd2a8f55c0b841b1acc21b878be83011/FLAG09732bb7e [2019-01-12 04:28:11,550 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b22c9d595/dd2a8f55c0b841b1acc21b878be83011 [2019-01-12 04:28:11,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:28:11,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:28:11,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:28:11,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:28:11,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:28:11,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:28:11" (1/1) ... [2019-01-12 04:28:11,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290c9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:11, skipping insertion in model container [2019-01-12 04:28:11,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:28:11" (1/1) ... [2019-01-12 04:28:11,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:28:11,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:28:12,123 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:28:12,128 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:28:12,414 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:28:12,439 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:28:12,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12 WrapperNode [2019-01-12 04:28:12,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:28:12,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:28:12,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:28:12,441 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:28:12,545 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:28:12" (1/1) ... [2019-01-12 04:28:12,581 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:28:12" (1/1) ... [2019-01-12 04:28:12,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:28:12,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:28:12,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:28:12,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:28:12,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (1/1) ... [2019-01-12 04:28:12,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:28:12,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:28:12,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:28:12,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:28:12,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (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:28:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:28:12,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:28:16,557 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:28:16,558 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 04:28:16,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:16 BoogieIcfgContainer [2019-01-12 04:28:16,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:28:16,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:28:16,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:28:16,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:28:16,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:28:11" (1/3) ... [2019-01-12 04:28:16,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208e99ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:28:16, skipping insertion in model container [2019-01-12 04:28:16,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:28:12" (2/3) ... [2019-01-12 04:28:16,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208e99ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:28:16, skipping insertion in model container [2019-01-12 04:28:16,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:28:16" (3/3) ... [2019-01-12 04:28:16,573 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label53_true-unreach-call_false-termination.c [2019-01-12 04:28:16,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:28:16,593 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:28:16,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:28:16,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:28:16,649 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:28:16,649 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:28:16,649 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:28:16,649 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:28:16,650 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:28:16,650 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:28:16,650 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:28:16,650 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:28:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 04:28:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 04:28:16,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:16,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:16,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2019-01-12 04:28:16,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:16,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:16,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:16,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:16,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:17,283 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:28:17,416 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:17,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:17,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:17,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:17,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:17,441 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 6 states. [2019-01-12 04:28:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:20,767 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2019-01-12 04:28:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:28:20,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-01-12 04:28:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:20,790 INFO L225 Difference]: With dead ends: 852 [2019-01-12 04:28:20,791 INFO L226 Difference]: Without dead ends: 538 [2019-01-12 04:28:20,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-12 04:28:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-01-12 04:28:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-01-12 04:28:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2019-01-12 04:28:20,879 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 49 [2019-01-12 04:28:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:20,879 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2019-01-12 04:28:20,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2019-01-12 04:28:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-12 04:28:20,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:20,889 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, 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, 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:20,889 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash -265131167, now seen corresponding path program 1 times [2019-01-12 04:28:20,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:20,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:20,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-12 04:28:21,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:21,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:21,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:21,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:21,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:21,133 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2019-01-12 04:28:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:23,300 INFO L93 Difference]: Finished difference Result 1252 states and 1948 transitions. [2019-01-12 04:28:23,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:23,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-01-12 04:28:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:23,308 INFO L225 Difference]: With dead ends: 1252 [2019-01-12 04:28:23,308 INFO L226 Difference]: Without dead ends: 894 [2019-01-12 04:28:23,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-01-12 04:28:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-01-12 04:28:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-01-12 04:28:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1206 transitions. [2019-01-12 04:28:23,375 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1206 transitions. Word has length 197 [2019-01-12 04:28:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:23,376 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1206 transitions. [2019-01-12 04:28:23,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1206 transitions. [2019-01-12 04:28:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-12 04:28:23,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:23,384 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:23,385 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:23,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1568066862, now seen corresponding path program 1 times [2019-01-12 04:28:23,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:23,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:23,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:23,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 150 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 04:28:23,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:23,877 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:23,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:23,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 04:28:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-12 04:28:24,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:24,148 INFO L87 Difference]: Start difference. First operand 894 states and 1206 transitions. Second operand 6 states. [2019-01-12 04:28:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:28,057 INFO L93 Difference]: Finished difference Result 2912 states and 4029 transitions. [2019-01-12 04:28:28,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:28:28,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2019-01-12 04:28:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:28,074 INFO L225 Difference]: With dead ends: 2912 [2019-01-12 04:28:28,074 INFO L226 Difference]: Without dead ends: 2140 [2019-01-12 04:28:28,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-01-12 04:28:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1250. [2019-01-12 04:28:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-01-12 04:28:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1382 transitions. [2019-01-12 04:28:28,121 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1382 transitions. Word has length 220 [2019-01-12 04:28:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:28,122 INFO L480 AbstractCegarLoop]: Abstraction has 1250 states and 1382 transitions. [2019-01-12 04:28:28,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1382 transitions. [2019-01-12 04:28:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-12 04:28:28,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:28,131 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:28,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1781618027, now seen corresponding path program 1 times [2019-01-12 04:28:28,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:28,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2019-01-12 04:28:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:28,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:28,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:28,790 INFO L87 Difference]: Start difference. First operand 1250 states and 1382 transitions. Second operand 4 states. [2019-01-12 04:28:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:30,483 INFO L93 Difference]: Finished difference Result 4100 states and 4617 transitions. [2019-01-12 04:28:30,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:30,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-01-12 04:28:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:30,500 INFO L225 Difference]: With dead ends: 4100 [2019-01-12 04:28:30,500 INFO L226 Difference]: Without dead ends: 3030 [2019-01-12 04:28:30,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-01-12 04:28:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 1962. [2019-01-12 04:28:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-01-12 04:28:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2141 transitions. [2019-01-12 04:28:30,547 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2141 transitions. Word has length 420 [2019-01-12 04:28:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:30,549 INFO L480 AbstractCegarLoop]: Abstraction has 1962 states and 2141 transitions. [2019-01-12 04:28:30,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2141 transitions. [2019-01-12 04:28:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-01-12 04:28:30,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:30,562 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2096484788, now seen corresponding path program 1 times [2019-01-12 04:28:30,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:30,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:30,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:30,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:30,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:31,296 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:28:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-01-12 04:28:31,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 04:28:31,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:31,875 INFO L87 Difference]: Start difference. First operand 1962 states and 2141 transitions. Second operand 8 states. [2019-01-12 04:28:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:33,746 INFO L93 Difference]: Finished difference Result 4112 states and 4490 transitions. [2019-01-12 04:28:33,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:33,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 517 [2019-01-12 04:28:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:33,757 INFO L225 Difference]: With dead ends: 4112 [2019-01-12 04:28:33,758 INFO L226 Difference]: Without dead ends: 2330 [2019-01-12 04:28:33,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:28:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2019-01-12 04:28:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2140. [2019-01-12 04:28:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-01-12 04:28:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2323 transitions. [2019-01-12 04:28:33,803 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2323 transitions. Word has length 517 [2019-01-12 04:28:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:33,804 INFO L480 AbstractCegarLoop]: Abstraction has 2140 states and 2323 transitions. [2019-01-12 04:28:33,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2323 transitions. [2019-01-12 04:28:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-01-12 04:28:33,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:33,817 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash -111934088, now seen corresponding path program 1 times [2019-01-12 04:28:33,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:33,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:33,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:33,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:33,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 591 proven. 4 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-01-12 04:28:34,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:34,657 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:34,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:34,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 572 proven. 23 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-01-12 04:28:35,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:35,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-12 04:28:35,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:35,445 INFO L87 Difference]: Start difference. First operand 2140 states and 2323 transitions. Second operand 8 states. [2019-01-12 04:28:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:37,690 INFO L93 Difference]: Finished difference Result 4492 states and 4863 transitions. [2019-01-12 04:28:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:28:37,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 541 [2019-01-12 04:28:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:37,701 INFO L225 Difference]: With dead ends: 4492 [2019-01-12 04:28:37,701 INFO L226 Difference]: Without dead ends: 2532 [2019-01-12 04:28:37,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:28:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2019-01-12 04:28:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2318. [2019-01-12 04:28:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-01-12 04:28:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2502 transitions. [2019-01-12 04:28:37,747 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2502 transitions. Word has length 541 [2019-01-12 04:28:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:37,748 INFO L480 AbstractCegarLoop]: Abstraction has 2318 states and 2502 transitions. [2019-01-12 04:28:37,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2502 transitions. [2019-01-12 04:28:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-01-12 04:28:37,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:37,764 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, 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, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:37,764 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash 186723207, now seen corresponding path program 1 times [2019-01-12 04:28:37,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:37,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 04:28:38,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:38,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:38,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:28:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:28:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:38,631 INFO L87 Difference]: Start difference. First operand 2318 states and 2502 transitions. Second operand 3 states. [2019-01-12 04:28:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:39,557 INFO L93 Difference]: Finished difference Result 5168 states and 5647 transitions. [2019-01-12 04:28:39,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:28:39,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 630 [2019-01-12 04:28:39,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:39,571 INFO L225 Difference]: With dead ends: 5168 [2019-01-12 04:28:39,571 INFO L226 Difference]: Without dead ends: 3030 [2019-01-12 04:28:39,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-01-12 04:28:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2019-01-12 04:28:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-01-12 04:28:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3108 transitions. [2019-01-12 04:28:39,626 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3108 transitions. Word has length 630 [2019-01-12 04:28:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:39,628 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3108 transitions. [2019-01-12 04:28:39,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:28:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3108 transitions. [2019-01-12 04:28:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-01-12 04:28:39,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:39,637 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:39,637 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:39,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:39,637 INFO L82 PathProgramCache]: Analyzing trace with hash -915113961, now seen corresponding path program 1 times [2019-01-12 04:28:39,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:39,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:39,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:40,009 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:28:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1094 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-01-12 04:28:40,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:40,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:40,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:28:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:28:40,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:40,181 INFO L87 Difference]: Start difference. First operand 2852 states and 3108 transitions. Second operand 3 states. [2019-01-12 04:28:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:40,812 INFO L93 Difference]: Finished difference Result 5880 states and 6423 transitions. [2019-01-12 04:28:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:28:40,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 632 [2019-01-12 04:28:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:40,822 INFO L225 Difference]: With dead ends: 5880 [2019-01-12 04:28:40,823 INFO L226 Difference]: Without dead ends: 3208 [2019-01-12 04:28:40,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-01-12 04:28:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2019-01-12 04:28:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-01-12 04:28:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3269 transitions. [2019-01-12 04:28:40,890 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3269 transitions. Word has length 632 [2019-01-12 04:28:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:40,891 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 3269 transitions. [2019-01-12 04:28:40,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:28:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3269 transitions. [2019-01-12 04:28:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-01-12 04:28:40,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:40,902 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, 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:40,902 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 740978942, now seen corresponding path program 1 times [2019-01-12 04:28:40,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:40,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 708 proven. 174 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 04:28:42,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:42,083 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:42,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:42,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 853 proven. 29 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 04:28:43,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:43,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-01-12 04:28:43,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:43,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:43,008 INFO L87 Difference]: Start difference. First operand 3030 states and 3269 transitions. Second operand 8 states. [2019-01-12 04:28:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:45,103 INFO L93 Difference]: Finished difference Result 6476 states and 6985 transitions. [2019-01-12 04:28:45,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:28:45,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 675 [2019-01-12 04:28:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:45,125 INFO L225 Difference]: With dead ends: 6476 [2019-01-12 04:28:45,126 INFO L226 Difference]: Without dead ends: 3626 [2019-01-12 04:28:45,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:28:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-12 04:28:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3386. [2019-01-12 04:28:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-12 04:28:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3634 transitions. [2019-01-12 04:28:45,244 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3634 transitions. Word has length 675 [2019-01-12 04:28:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:45,245 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3634 transitions. [2019-01-12 04:28:45,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3634 transitions. [2019-01-12 04:28:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2019-01-12 04:28:45,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:45,256 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 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] [2019-01-12 04:28:45,256 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:45,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:45,257 INFO L82 PathProgramCache]: Analyzing trace with hash -851297330, now seen corresponding path program 1 times [2019-01-12 04:28:45,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:45,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:45,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:45,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2019-01-12 04:28:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:28:45,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:28:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:28:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:45,867 INFO L87 Difference]: Start difference. First operand 3386 states and 3634 transitions. Second operand 7 states. [2019-01-12 04:28:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:46,681 INFO L93 Difference]: Finished difference Result 6820 states and 7328 transitions. [2019-01-12 04:28:46,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:28:46,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 677 [2019-01-12 04:28:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:46,696 INFO L225 Difference]: With dead ends: 6820 [2019-01-12 04:28:46,696 INFO L226 Difference]: Without dead ends: 3564 [2019-01-12 04:28:46,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-01-12 04:28:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2019-01-12 04:28:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-01-12 04:28:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3589 transitions. [2019-01-12 04:28:46,760 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3589 transitions. Word has length 677 [2019-01-12 04:28:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:46,761 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3589 transitions. [2019-01-12 04:28:46,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:28:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3589 transitions. [2019-01-12 04:28:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-01-12 04:28:46,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:46,771 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:46,772 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash 286131592, now seen corresponding path program 1 times [2019-01-12 04:28:46,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:46,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:46,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 1114 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-01-12 04:28:47,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:47,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:47,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:28:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:28:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:47,293 INFO L87 Difference]: Start difference. First operand 3386 states and 3589 transitions. Second operand 3 states. [2019-01-12 04:28:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:48,077 INFO L93 Difference]: Finished difference Result 7304 states and 7755 transitions. [2019-01-12 04:28:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:28:48,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 702 [2019-01-12 04:28:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:48,095 INFO L225 Difference]: With dead ends: 7304 [2019-01-12 04:28:48,095 INFO L226 Difference]: Without dead ends: 4098 [2019-01-12 04:28:48,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-01-12 04:28:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-01-12 04:28:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:28:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4324 transitions. [2019-01-12 04:28:48,168 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4324 transitions. Word has length 702 [2019-01-12 04:28:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:48,169 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4324 transitions. [2019-01-12 04:28:48,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:28:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4324 transitions. [2019-01-12 04:28:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2019-01-12 04:28:48,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:48,181 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, 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, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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:48,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:48,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash -570726484, now seen corresponding path program 1 times [2019-01-12 04:28:48,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:48,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:48,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:48,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:48,669 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 04:28:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-01-12 04:28:49,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:49,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:49,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:49,279 INFO L87 Difference]: Start difference. First operand 4098 states and 4324 transitions. Second operand 4 states. [2019-01-12 04:28:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:51,090 INFO L93 Difference]: Finished difference Result 9262 states and 9858 transitions. [2019-01-12 04:28:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:51,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 857 [2019-01-12 04:28:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:51,103 INFO L225 Difference]: With dead ends: 9262 [2019-01-12 04:28:51,104 INFO L226 Difference]: Without dead ends: 5344 [2019-01-12 04:28:51,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-01-12 04:28:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4988. [2019-01-12 04:28:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-01-12 04:28:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5249 transitions. [2019-01-12 04:28:51,182 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5249 transitions. Word has length 857 [2019-01-12 04:28:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:51,183 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5249 transitions. [2019-01-12 04:28:51,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5249 transitions. [2019-01-12 04:28:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2019-01-12 04:28:51,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:51,195 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, 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, 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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:51,195 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -948706177, now seen corresponding path program 1 times [2019-01-12 04:28:51,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:51,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:51,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:51,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1620 proven. 199 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-01-12 04:28:52,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:52,776 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:52,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:52,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1527 proven. 93 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2019-01-12 04:28:54,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:28:54,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-01-12 04:28:54,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:54,013 INFO L87 Difference]: Start difference. First operand 4988 states and 5249 transitions. Second operand 8 states. [2019-01-12 04:28:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:55,913 INFO L93 Difference]: Finished difference Result 11301 states and 11890 transitions. [2019-01-12 04:28:55,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:28:55,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 875 [2019-01-12 04:28:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:55,927 INFO L225 Difference]: With dead ends: 11301 [2019-01-12 04:28:55,927 INFO L226 Difference]: Without dead ends: 6493 [2019-01-12 04:28:55,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6493 states. [2019-01-12 04:28:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6493 to 5344. [2019-01-12 04:28:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-01-12 04:28:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5605 transitions. [2019-01-12 04:28:56,022 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5605 transitions. Word has length 875 [2019-01-12 04:28:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:56,023 INFO L480 AbstractCegarLoop]: Abstraction has 5344 states and 5605 transitions. [2019-01-12 04:28:56,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5605 transitions. [2019-01-12 04:28:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2019-01-12 04:28:56,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:56,035 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, 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, 7, 7, 7, 7, 7, 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, 4, 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, 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:56,036 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1227190264, now seen corresponding path program 1 times [2019-01-12 04:28:56,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:56,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:56,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1578 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-01-12 04:28:56,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:56,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:28:56,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:28:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:28:56,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:56,798 INFO L87 Difference]: Start difference. First operand 5344 states and 5605 transitions. Second operand 5 states. [2019-01-12 04:28:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:58,007 INFO L93 Difference]: Finished difference Result 11576 states and 12149 transitions. [2019-01-12 04:28:58,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:28:58,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 952 [2019-01-12 04:28:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:58,019 INFO L225 Difference]: With dead ends: 11576 [2019-01-12 04:28:58,020 INFO L226 Difference]: Without dead ends: 6412 [2019-01-12 04:28:58,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:28:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-01-12 04:28:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5878. [2019-01-12 04:28:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-01-12 04:28:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6159 transitions. [2019-01-12 04:28:58,141 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6159 transitions. Word has length 952 [2019-01-12 04:28:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:58,142 INFO L480 AbstractCegarLoop]: Abstraction has 5878 states and 6159 transitions. [2019-01-12 04:28:58,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:28:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6159 transitions. [2019-01-12 04:28:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1596 [2019-01-12 04:28:58,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:58,169 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, 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, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 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, 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:58,169 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash -890235928, now seen corresponding path program 1 times [2019-01-12 04:28:58,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:58,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:59,117 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 04:29:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8269 backedges. 1578 proven. 0 refuted. 0 times theorem prover too weak. 6691 trivial. 0 not checked. [2019-01-12 04:29:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:00,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:00,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:00,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:00,844 INFO L87 Difference]: Start difference. First operand 5878 states and 6159 transitions. Second operand 4 states. [2019-01-12 04:29:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:01,932 INFO L93 Difference]: Finished difference Result 11932 states and 12529 transitions. [2019-01-12 04:29:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:01,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1595 [2019-01-12 04:29:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:01,947 INFO L225 Difference]: With dead ends: 11932 [2019-01-12 04:29:01,947 INFO L226 Difference]: Without dead ends: 6234 [2019-01-12 04:29:01,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-01-12 04:29:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5700. [2019-01-12 04:29:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-01-12 04:29:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5952 transitions. [2019-01-12 04:29:02,066 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5952 transitions. Word has length 1595 [2019-01-12 04:29:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:02,067 INFO L480 AbstractCegarLoop]: Abstraction has 5700 states and 5952 transitions. [2019-01-12 04:29:02,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5952 transitions. [2019-01-12 04:29:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2019-01-12 04:29:02,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:02,095 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, 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, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 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, 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] [2019-01-12 04:29:02,096 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash 698233105, now seen corresponding path program 1 times [2019-01-12 04:29:02,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 2883 proven. 0 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2019-01-12 04:29:03,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:03,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:03,761 INFO L87 Difference]: Start difference. First operand 5700 states and 5952 transitions. Second operand 4 states. [2019-01-12 04:29:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:05,036 INFO L93 Difference]: Finished difference Result 12466 states and 12979 transitions. [2019-01-12 04:29:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:05,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1662 [2019-01-12 04:29:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:05,046 INFO L225 Difference]: With dead ends: 12466 [2019-01-12 04:29:05,046 INFO L226 Difference]: Without dead ends: 4276 [2019-01-12 04:29:05,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-01-12 04:29:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3742. [2019-01-12 04:29:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-01-12 04:29:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3806 transitions. [2019-01-12 04:29:05,111 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3806 transitions. Word has length 1662 [2019-01-12 04:29:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:05,112 INFO L480 AbstractCegarLoop]: Abstraction has 3742 states and 3806 transitions. [2019-01-12 04:29:05,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3806 transitions. [2019-01-12 04:29:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1681 [2019-01-12 04:29:05,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:05,140 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, 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, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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:29:05,140 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:05,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1087144341, now seen corresponding path program 1 times [2019-01-12 04:29:05,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:05,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:05,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:05,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:06,504 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-12 04:29:06,872 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-01-12 04:29:07,120 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 04:29:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2725 proven. 0 refuted. 0 times theorem prover too weak. 5888 trivial. 0 not checked. [2019-01-12 04:29:08,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:08,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:29:08,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:29:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:29:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:08,764 INFO L87 Difference]: Start difference. First operand 3742 states and 3806 transitions. Second operand 7 states. [2019-01-12 04:29:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:09,896 INFO L93 Difference]: Finished difference Result 7364 states and 7494 transitions. [2019-01-12 04:29:09,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:29:09,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1680 [2019-01-12 04:29:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:09,904 INFO L225 Difference]: With dead ends: 7364 [2019-01-12 04:29:09,904 INFO L226 Difference]: Without dead ends: 3920 [2019-01-12 04:29:09,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-01-12 04:29:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2019-01-12 04:29:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-01-12 04:29:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3805 transitions. [2019-01-12 04:29:09,962 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3805 transitions. Word has length 1680 [2019-01-12 04:29:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:09,963 INFO L480 AbstractCegarLoop]: Abstraction has 3742 states and 3805 transitions. [2019-01-12 04:29:09,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:29:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3805 transitions. [2019-01-12 04:29:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1734 [2019-01-12 04:29:09,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:09,990 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, 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, 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, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1] [2019-01-12 04:29:09,990 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2019243921, now seen corresponding path program 1 times [2019-01-12 04:29:09,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:09,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 4820 proven. 387 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2019-01-12 04:29:12,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:12,590 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:29:12,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:12,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:13,436 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2019-01-12 04:29:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 2831 proven. 176 refuted. 0 times theorem prover too weak. 6776 trivial. 0 not checked. [2019-01-12 04:29:15,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:15,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-01-12 04:29:15,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 04:29:15,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 04:29:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:29:15,468 INFO L87 Difference]: Start difference. First operand 3742 states and 3805 transitions. Second operand 10 states. [2019-01-12 04:29:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:21,319 INFO L93 Difference]: Finished difference Result 10688 states and 10908 transitions. [2019-01-12 04:29:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 04:29:21,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1733 [2019-01-12 04:29:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:21,328 INFO L225 Difference]: With dead ends: 10688 [2019-01-12 04:29:21,328 INFO L226 Difference]: Without dead ends: 5880 [2019-01-12 04:29:21,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1755 GetRequests, 1737 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-01-12 04:29:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2019-01-12 04:29:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 4810. [2019-01-12 04:29:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-01-12 04:29:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4893 transitions. [2019-01-12 04:29:21,408 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4893 transitions. Word has length 1733 [2019-01-12 04:29:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:21,409 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 4893 transitions. [2019-01-12 04:29:21,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 04:29:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4893 transitions. [2019-01-12 04:29:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1860 [2019-01-12 04:29:21,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:21,439 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 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, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 1, 1] [2019-01-12 04:29:21,439 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:21,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -99452203, now seen corresponding path program 1 times [2019-01-12 04:29:21,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:21,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:21,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:21,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:22,212 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 04:29:22,473 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:29:22,760 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-12 04:29:23,111 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 04:29:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11355 backedges. 7573 proven. 76 refuted. 0 times theorem prover too weak. 3706 trivial. 0 not checked. [2019-01-12 04:29:24,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:24,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:24,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:25,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11355 backedges. 7614 proven. 0 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-12 04:29:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:29:29,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2019-01-12 04:29:29,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:29:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:29:29,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:29:29,326 INFO L87 Difference]: Start difference. First operand 4810 states and 4893 transitions. Second operand 11 states. [2019-01-12 04:29:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:32,764 INFO L93 Difference]: Finished difference Result 9093 states and 9256 transitions. [2019-01-12 04:29:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:29:32,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1859 [2019-01-12 04:29:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:32,770 INFO L225 Difference]: With dead ends: 9093 [2019-01-12 04:29:32,770 INFO L226 Difference]: Without dead ends: 4819 [2019-01-12 04:29:32,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1887 GetRequests, 1864 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-01-12 04:29:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-01-12 04:29:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 3920. [2019-01-12 04:29:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-01-12 04:29:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3965 transitions. [2019-01-12 04:29:32,821 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3965 transitions. Word has length 1859 [2019-01-12 04:29:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:32,822 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3965 transitions. [2019-01-12 04:29:32,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:29:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3965 transitions. [2019-01-12 04:29:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2019-01-12 04:29:32,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:32,849 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 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, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 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, 1, 1] [2019-01-12 04:29:32,850 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:32,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:32,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1979324035, now seen corresponding path program 1 times [2019-01-12 04:29:32,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:32,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:32,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:32,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:33,637 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 04:29:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3204 proven. 0 refuted. 0 times theorem prover too weak. 8305 trivial. 0 not checked. [2019-01-12 04:29:35,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:35,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:29:35,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:29:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:29:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:35,796 INFO L87 Difference]: Start difference. First operand 3920 states and 3965 transitions. Second operand 7 states. [2019-01-12 04:29:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:36,566 INFO L93 Difference]: Finished difference Result 7175 states and 7261 transitions. [2019-01-12 04:29:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:29:36,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1903 [2019-01-12 04:29:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:36,572 INFO L225 Difference]: With dead ends: 7175 [2019-01-12 04:29:36,572 INFO L226 Difference]: Without dead ends: 3920 [2019-01-12 04:29:36,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-01-12 04:29:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2019-01-12 04:29:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-01-12 04:29:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 3961 transitions. [2019-01-12 04:29:36,613 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 3961 transitions. Word has length 1903 [2019-01-12 04:29:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:36,614 INFO L480 AbstractCegarLoop]: Abstraction has 3920 states and 3961 transitions. [2019-01-12 04:29:36,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:29:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 3961 transitions. [2019-01-12 04:29:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2019-01-12 04:29:36,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:36,636 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 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, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 1, 1, 1] [2019-01-12 04:29:36,637 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:36,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:36,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1253846088, now seen corresponding path program 1 times [2019-01-12 04:29:36,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:36,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:36,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:36,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:36,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 3405 proven. 129 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2019-01-12 04:29:38,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:29:38,773 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:29:38,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:39,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:29:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 3440 proven. 94 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2019-01-12 04:29:41,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:29:41,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-01-12 04:29:41,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:29:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:29:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:29:41,236 INFO L87 Difference]: Start difference. First operand 3920 states and 3961 transitions. Second operand 7 states. [2019-01-12 04:29:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:43,208 INFO L93 Difference]: Finished difference Result 7480 states and 7563 transitions. [2019-01-12 04:29:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:29:43,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2035 [2019-01-12 04:29:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:43,215 INFO L225 Difference]: With dead ends: 7480 [2019-01-12 04:29:43,215 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:29:43,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2043 GetRequests, 2035 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:29:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:29:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:29:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:29:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:29:43,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2035 [2019-01-12 04:29:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:43,220 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:29:43,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:29:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:29:43,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:29:43,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:29:43,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,821 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 321 [2019-01-12 04:29:43,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:43,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:29:44,266 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 321 [2019-01-12 04:31:07,407 WARN L181 SmtUtils]: Spent 1.39 m on a formula simplification. DAG size of input: 300 DAG size of output: 137 [2019-01-12 04:32:57,501 WARN L181 SmtUtils]: Spent 1.83 m on a formula simplification. DAG size of input: 300 DAG size of output: 137 [2019-01-12 04:32:57,504 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-01-12 04:32:57,505 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-01-12 04:32:57,506 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-01-12 04:32:57,507 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-01-12 04:32:57,508 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,509 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,509 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-01-12 04:32:57,510 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,511 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,512 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,513 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,514 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:32:57,516 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:32:57,516 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:32:57,516 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-01-12 04:32:57,516 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:32:57,517 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-01-12 04:32:57,518 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-01-12 04:32:57,519 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-01-12 04:32:57,519 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:32:57,526 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-01-12 04:32:57,527 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,528 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,534 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse17 (= ~a15~0 7))) (let ((.cse29 (not .cse17)) (.cse30 (<= ~a15~0 8))) (let ((.cse2 (= ~a21~0 7)) (.cse0 (= ~a15~0 8)) (.cse11 (= ~a21~0 9)) (.cse1 (= ~a24~0 1)) (.cse12 (= ~a21~0 8)) (.cse20 (or (and .cse29 .cse30) (and (not (= 10 ~a21~0)) .cse30))) (.cse26 (< 0 (+ ~a12~0 43)))) (let ((.cse15 (and (<= ~a12~0 80) .cse20 .cse26)) (.cse25 (= ~a21~0 6)) (.cse18 (<= ~a12~0 73282)) (.cse21 (not .cse12)) (.cse31 (and .cse20 (not .cse11) .cse1)) (.cse14 (not .cse0)) (.cse23 (not .cse2)) (.cse4 (= ~a21~0 10)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= ~a12~0 11)) (.cse10 (< 80 ~a12~0))) (let ((.cse6 (or .cse24 .cse10)) (.cse16 (or (< 11 ~a12~0) .cse0)) (.cse13 (or (and (and .cse0 .cse1 .cse4) .cse8) (and .cse0 .cse24))) (.cse19 (= ~a15~0 5)) (.cse27 (exists ((v_prenex_55 Int)) (and (= ~a12~0 (+ (mod v_prenex_55 299959) 300041)) (< 80 v_prenex_55) (<= 0 v_prenex_55)))) (.cse9 (<= ~a12~0 586307)) (.cse5 (= ~a15~0 9)) (.cse7 (or (and (and .cse25 .cse29 .cse30) .cse14) (and .cse18 .cse21 .cse31 .cse14 .cse23))) (.cse28 (<= ~a21~0 6)) (.cse22 (and .cse15 .cse1)) (.cse3 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~a12~0 599999) (or (and .cse4 .cse5 .cse1 .cse6) (and .cse7 .cse4 .cse8))) (and .cse1 .cse9 .cse5 .cse10 .cse11) (and .cse1 .cse12 (<= (+ ~a12~0 526767) 0) .cse5) (and (and .cse9 .cse2 .cse5) .cse1 .cse10) (and .cse13 .cse10) (and .cse14 (and .cse15 .cse16 .cse1)) (and .cse17 .cse1 .cse4 .cse6) (and .cse18 (not .cse19) (and .cse20 .cse1 .cse12) .cse8) (and (and .cse20 .cse16 .cse1) .cse14 .cse11) (and .cse21 .cse14 .cse22 .cse23) (and .cse13 .cse1 .cse4 .cse24) (and .cse1 .cse9 .cse12 .cse5 .cse8) (and .cse25 .cse1 (= ~a15~0 6)) (and (and .cse15 .cse1 .cse24) .cse11) (and (and .cse25 .cse1) .cse19) (and .cse1 .cse5 .cse12 .cse24 .cse26) (and (and .cse1 .cse0) .cse2 .cse24 .cse26) (and .cse27 .cse1 .cse5 .cse11) (and .cse27 (or (and .cse5 .cse12) (and .cse2 .cse5)) .cse1) (and (<= 95381 ~a12~0) .cse1 .cse9 .cse5 .cse28) (and .cse7 .cse24 .cse28) (and .cse25 .cse0 (exists ((v_prenex_2 Int)) (and (< 80 v_prenex_2) (= (+ (mod v_prenex_2 299959) 286349) ~a12~0) (<= 0 v_prenex_2))) .cse1) (and .cse22 .cse11 .cse8) (and (and (or (and .cse29 .cse1 .cse30) (and .cse1 .cse30 .cse3)) .cse11) .cse14) (and .cse17 .cse31))))))) [2019-01-12 04:32:57,534 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,535 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-01-12 04:32:57,535 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-01-12 04:32:57,536 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-01-12 04:32:57,537 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:32:57,538 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:32:57,539 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-01-12 04:32:57,539 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-01-12 04:32:57,541 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,541 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,541 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 04:32:57,541 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,541 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse17 (= ~a15~0 7))) (let ((.cse29 (not .cse17)) (.cse30 (<= ~a15~0 8))) (let ((.cse2 (= ~a21~0 7)) (.cse0 (= ~a15~0 8)) (.cse11 (= ~a21~0 9)) (.cse1 (= ~a24~0 1)) (.cse12 (= ~a21~0 8)) (.cse20 (or (and .cse29 .cse30) (and (not (= 10 ~a21~0)) .cse30))) (.cse26 (< 0 (+ ~a12~0 43)))) (let ((.cse15 (and (<= ~a12~0 80) .cse20 .cse26)) (.cse25 (= ~a21~0 6)) (.cse18 (<= ~a12~0 73282)) (.cse21 (not .cse12)) (.cse31 (and .cse20 (not .cse11) .cse1)) (.cse14 (not .cse0)) (.cse23 (not .cse2)) (.cse4 (= ~a21~0 10)) (.cse8 (<= 19 ~a12~0)) (.cse24 (<= ~a12~0 11)) (.cse10 (< 80 ~a12~0))) (let ((.cse6 (or .cse24 .cse10)) (.cse16 (or (< 11 ~a12~0) .cse0)) (.cse13 (or (and (and .cse0 .cse1 .cse4) .cse8) (and .cse0 .cse24))) (.cse19 (= ~a15~0 5)) (.cse27 (exists ((v_prenex_55 Int)) (and (= ~a12~0 (+ (mod v_prenex_55 299959) 300041)) (< 80 v_prenex_55) (<= 0 v_prenex_55)))) (.cse9 (<= ~a12~0 586307)) (.cse5 (= ~a15~0 9)) (.cse7 (or (and (and .cse25 .cse29 .cse30) .cse14) (and .cse18 .cse21 .cse31 .cse14 .cse23))) (.cse28 (<= ~a21~0 6)) (.cse22 (and .cse15 .cse1)) (.cse3 (<= (+ ~a12~0 49) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ~a12~0 599999) (or (and .cse4 .cse5 .cse1 .cse6) (and .cse7 .cse4 .cse8))) (and .cse1 .cse9 .cse5 .cse10 .cse11) (and .cse1 .cse12 (<= (+ ~a12~0 526767) 0) .cse5) (and (and .cse9 .cse2 .cse5) .cse1 .cse10) (and .cse13 .cse10) (and .cse14 (and .cse15 .cse16 .cse1)) (and .cse17 .cse1 .cse4 .cse6) (and .cse18 (not .cse19) (and .cse20 .cse1 .cse12) .cse8) (and (and .cse20 .cse16 .cse1) .cse14 .cse11) (and .cse21 .cse14 .cse22 .cse23) (and .cse13 .cse1 .cse4 .cse24) (and .cse1 .cse9 .cse12 .cse5 .cse8) (and .cse25 .cse1 (= ~a15~0 6)) (and (and .cse15 .cse1 .cse24) .cse11) (and (and .cse25 .cse1) .cse19) (and .cse1 .cse5 .cse12 .cse24 .cse26) (and (and .cse1 .cse0) .cse2 .cse24 .cse26) (and .cse27 .cse1 .cse5 .cse11) (and .cse27 (or (and .cse5 .cse12) (and .cse2 .cse5)) .cse1) (and (<= 95381 ~a12~0) .cse1 .cse9 .cse5 .cse28) (and .cse7 .cse24 .cse28) (and .cse25 .cse0 (exists ((v_prenex_2 Int)) (and (< 80 v_prenex_2) (= (+ (mod v_prenex_2 299959) 286349) ~a12~0) (<= 0 v_prenex_2))) .cse1) (and .cse22 .cse11 .cse8) (and (and (or (and .cse29 .cse1 .cse30) (and .cse1 .cse30 .cse3)) .cse11) .cse14) (and .cse17 .cse31))))))) [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-01-12 04:32:57,542 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-01-12 04:32:57,543 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-01-12 04:32:57,544 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,544 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-01-12 04:32:57,546 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-01-12 04:32:57,547 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:32:57,548 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-01-12 04:32:57,576 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,628 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,629 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,629 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,629 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,641 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:32:57 BoogieIcfgContainer [2019-01-12 04:32:57,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:32:57,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:32:57,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:32:57,652 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:32:57,652 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:16" (3/4) ... [2019-01-12 04:32:57,663 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:32:57,706 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 04:32:57,708 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:32:57,752 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) [2019-01-12 04:32:57,759 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) [2019-01-12 04:32:57,916 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:32:57,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:32:57,917 INFO L168 Benchmark]: Toolchain (without parser) took 286362.45 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 940.6 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 300.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:32:57,917 INFO L168 Benchmark]: CDTParser took 0.16 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:32:57,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 884.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 908.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:32:57,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 271.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 908.4 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:32:57,918 INFO L168 Benchmark]: Boogie Preprocessor took 131.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:32:57,918 INFO L168 Benchmark]: RCFGBuilder took 3714.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 955.8 MB in the end (delta: 123.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:32:57,922 INFO L168 Benchmark]: TraceAbstraction took 281089.62 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 955.8 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:32:57,922 INFO L168 Benchmark]: Witness Printer took 264.32 ms. Allocated memory is still 5.0 GB. Free memory is still 4.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:32:57,926 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.16 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 884.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 908.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 271.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 908.4 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 131.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3714.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 955.8 MB in the end (delta: 123.3 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 281089.62 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 955.8 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 264.32 ms. Allocated memory is still 5.0 GB. Free memory is still 4.7 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: 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 [2019-01-12 04:32:57,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,945 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,946 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,947 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 04:32:57,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,952 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_55,QUANTIFIED] [2019-01-12 04:32:57,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 04:32:57,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a15 == 8 && a24 == 1) && a21 == 7) && a12 + 49 <= 0) || (a12 <= 599999 && ((((a21 == 10 && a15 == 9) && a24 == 1) && (a12 <= 11 || 80 < a12)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a21 == 10) && 19 <= a12)))) || ((((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9)) || ((((a12 <= 586307 && a21 == 7) && a15 == 9) && a24 == 1) && 80 < a12)) || (((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && 80 < a12)) || (!(a15 == 8) && (((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && (11 < a12 || a15 == 8)) && a24 == 1)) || (((a15 == 7 && a24 == 1) && a21 == 10) && (a12 <= 11 || 80 < a12))) || (((a12 <= 73282 && !(a15 == 5)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && a24 == 1) && a21 == 8) && 19 <= a12)) || ((((((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && (11 < a12 || a15 == 8)) && a24 == 1) && !(a15 == 8)) && a21 == 9)) || (((!(a21 == 8) && !(a15 == 8)) && ((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && !(a21 == 7))) || (((((((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12) || (a15 == 8 && a12 <= 11)) && a24 == 1) && a21 == 10) && a12 <= 11)) || ((((a24 == 1 && a12 <= 586307) && a21 == 8) && a15 == 9) && 19 <= a12)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a12 <= 11) && a21 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((((a24 == 1 && a15 == 9) && a21 == 8) && a12 <= 11) && 0 < a12 + 43)) || ((((a24 == 1 && a15 == 8) && a21 == 7) && a12 <= 11) && 0 < a12 + 43)) || ((((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && a24 == 1) && a15 == 9) && a21 == 9)) || (((\exists v_prenex_55 : int :: (a12 == v_prenex_55 % 299959 + 300041 && 80 < v_prenex_55) && 0 <= v_prenex_55) && ((a15 == 9 && a21 == 8) || (a21 == 7 && a15 == 9))) && a24 == 1)) || ((((95381 <= a12 && a24 == 1) && a12 <= 586307) && a15 == 9) && a21 <= 6)) || ((((((a21 == 6 && !(a15 == 7)) && a15 <= 8) && !(a15 == 8)) || ((((a12 <= 73282 && !(a21 == 8)) && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) && !(a15 == 8)) && !(a21 == 7))) && a12 <= 11) && a21 <= 6)) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((a12 <= 80 && ((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8))) && 0 < a12 + 43) && a24 == 1) && a21 == 9) && 19 <= a12)) || (((((!(a15 == 7) && a24 == 1) && a15 <= 8) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) && a21 == 9) && !(a15 == 8))) || (a15 == 7 && (((!(a15 == 7) && a15 <= 8) || (!(10 == a21) && a15 <= 8)) && !(a21 == 9)) && a24 == 1) - 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, 280.9s OverallTime, 21 OverallIterations, 17 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 194.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1180 SDtfs, 8284 SDslu, 425 SDs, 0 SdLazy, 28927 SolverSat, 2516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8099 GetRequests, 7966 SyntacticMatches, 21 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5878occurred in iteration=14, 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: 1.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 8390 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 112 NumberOfFragments, 1515 HoareAnnotationTreeSize, 3 FomulaSimplifications, 232792 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 125742 FormulaSimplificationTreeSizeReductionInter, 193.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 28349 NumberOfCodeBlocks, 28349 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 28321 ConstructedInterpolants, 164 QuantifiedInterpolants, 105577974 SizeOfPredicates, 18 NumberOfNonLiveVariables, 9645 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 125894/127282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...