java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:09:01,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:09:01,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:09:01,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:09:01,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:09:01,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:09:01,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:09:01,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:09:01,498 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:09:01,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:09:01,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:09:01,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:09:01,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:09:01,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:09:01,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:09:01,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:09:01,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:09:01,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:09:01,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:09:01,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:09:01,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:09:01,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:09:01,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:09:01,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:09:01,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:09:01,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:09:01,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:09:01,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:09:01,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:09:01,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:09:01,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:09:01,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:09:01,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:09:01,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:09:01,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:09:01,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:09:01,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:09:01,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:09:01,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:09:01,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:09:01,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:09:01,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:09:01,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:09:01,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:09:01,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:09:01,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:09:01,545 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:09:01,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:09:01,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:09:01,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:09:01,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:09:01,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:09:01,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:09:01,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:09:01,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:09:01,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:09:01,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:09:01,547 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:09:01,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:09:01,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:09:01,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:09:01,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:09:01,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:09:01,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:09:01,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:09:01,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:09:01,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:09:01,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:09:01,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:09:01,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:09:01,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:09:01,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:09:01,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:09:01,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:09:01,597 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:09:01,598 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:09:01,598 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label54.c [2019-10-02 01:09:01,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1edb620/b16a09593da24cca8cf6fe3172954e4a/FLAG0b5e9b545 [2019-10-02 01:09:02,282 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:09:02,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label54.c [2019-10-02 01:09:02,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1edb620/b16a09593da24cca8cf6fe3172954e4a/FLAG0b5e9b545 [2019-10-02 01:09:02,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1edb620/b16a09593da24cca8cf6fe3172954e4a [2019-10-02 01:09:02,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:09:02,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:09:02,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:09:02,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:09:02,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:09:02,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:09:02" (1/1) ... [2019-10-02 01:09:02,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40bebede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:02, skipping insertion in model container [2019-10-02 01:09:02,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:09:02" (1/1) ... [2019-10-02 01:09:02,510 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:09:02,575 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:09:03,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:09:03,250 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:09:03,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:09:03,469 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:09:03,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03 WrapperNode [2019-10-02 01:09:03,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:09:03,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:09:03,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:09:03,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:09:03,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (1/1) ... [2019-10-02 01:09:03,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:09:03,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:09:03,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:09:03,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:09:03,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (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-10-02 01:09:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:09:03,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:09:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:09:03,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:09:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:09:03,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:09:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:09:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:09:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:09:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:09:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:09:05,507 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:09:05,508 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:09:05,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:09:05 BoogieIcfgContainer [2019-10-02 01:09:05,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:09:05,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:09:05,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:09:05,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:09:05,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:09:02" (1/3) ... [2019-10-02 01:09:05,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ac6146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:09:05, skipping insertion in model container [2019-10-02 01:09:05,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:03" (2/3) ... [2019-10-02 01:09:05,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ac6146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:09:05, skipping insertion in model container [2019-10-02 01:09:05,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:09:05" (3/3) ... [2019-10-02 01:09:05,519 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2019-10-02 01:09:05,529 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:09:05,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:09:05,556 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:09:05,591 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:09:05,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:09:05,592 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:09:05,592 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:09:05,592 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:09:05,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:09:05,593 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:09:05,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:09:05,593 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:09:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-02 01:09:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 01:09:05,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:05,666 INFO L411 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] [2019-10-02 01:09:05,668 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1043442102, now seen corresponding path program 1 times [2019-10-02 01:09:05,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:05,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:06,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:09:06,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:09:06,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:09:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:09:06,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:09:06,122 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2019-10-02 01:09:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:08,293 INFO L93 Difference]: Finished difference Result 994 states and 1776 transitions. [2019-10-02 01:09:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:09:08,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-02 01:09:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:08,319 INFO L225 Difference]: With dead ends: 994 [2019-10-02 01:09:08,319 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 01:09:08,331 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-02 01:09:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 01:09:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 614. [2019-10-02 01:09:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 01:09:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 908 transitions. [2019-10-02 01:09:08,453 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 908 transitions. Word has length 43 [2019-10-02 01:09:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:08,454 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 908 transitions. [2019-10-02 01:09:08,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:09:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 908 transitions. [2019-10-02 01:09:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 01:09:08,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:08,461 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:09:08,461 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2051275321, now seen corresponding path program 1 times [2019-10-02 01:09:08,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:08,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:08,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:08,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:08,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:08,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:09:08,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:09:08,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:09:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:09:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:09:08,690 INFO L87 Difference]: Start difference. First operand 614 states and 908 transitions. Second operand 4 states. [2019-10-02 01:09:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:10,584 INFO L93 Difference]: Finished difference Result 2367 states and 3579 transitions. [2019-10-02 01:09:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:09:10,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 01:09:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:10,599 INFO L225 Difference]: With dead ends: 2367 [2019-10-02 01:09:10,600 INFO L226 Difference]: Without dead ends: 1759 [2019-10-02 01:09:10,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-02 01:09:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2019-10-02 01:09:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1183. [2019-10-02 01:09:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-02 01:09:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1681 transitions. [2019-10-02 01:09:10,675 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1681 transitions. Word has length 116 [2019-10-02 01:09:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:10,676 INFO L475 AbstractCegarLoop]: Abstraction has 1183 states and 1681 transitions. [2019-10-02 01:09:10,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:09:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1681 transitions. [2019-10-02 01:09:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 01:09:10,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:10,691 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 01:09:10,692 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash -442913762, now seen corresponding path program 1 times [2019-10-02 01:09:10,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:10,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:10,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:09:10,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:09:10,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:09:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:09:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:09:10,934 INFO L87 Difference]: Start difference. First operand 1183 states and 1681 transitions. Second operand 6 states. [2019-10-02 01:09:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:13,514 INFO L93 Difference]: Finished difference Result 3648 states and 5882 transitions. [2019-10-02 01:09:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:09:13,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 01:09:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:13,538 INFO L225 Difference]: With dead ends: 3648 [2019-10-02 01:09:13,538 INFO L226 Difference]: Without dead ends: 2471 [2019-10-02 01:09:13,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:09:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-10-02 01:09:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2397. [2019-10-02 01:09:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2397 states. [2019-10-02 01:09:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3442 transitions. [2019-10-02 01:09:13,693 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3442 transitions. Word has length 141 [2019-10-02 01:09:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:13,694 INFO L475 AbstractCegarLoop]: Abstraction has 2397 states and 3442 transitions. [2019-10-02 01:09:13,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:09:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3442 transitions. [2019-10-02 01:09:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 01:09:13,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:13,702 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:09:13,702 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1861817831, now seen corresponding path program 1 times [2019-10-02 01:09:13,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:09:13,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:13,904 INFO L224 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-10-02 01:09:13,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:14,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:09:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:09:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:09:14,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:09:14,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:09:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:09:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:09:14,195 INFO L87 Difference]: Start difference. First operand 2397 states and 3442 transitions. Second operand 9 states. [2019-10-02 01:09:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:16,875 INFO L93 Difference]: Finished difference Result 9035 states and 15182 transitions. [2019-10-02 01:09:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:09:16,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2019-10-02 01:09:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:16,932 INFO L225 Difference]: With dead ends: 9035 [2019-10-02 01:09:16,932 INFO L226 Difference]: Without dead ends: 6644 [2019-10-02 01:09:16,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:09:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6644 states. [2019-10-02 01:09:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6644 to 6536. [2019-10-02 01:09:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-02 01:09:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 9980 transitions. [2019-10-02 01:09:17,304 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 9980 transitions. Word has length 204 [2019-10-02 01:09:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:17,306 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 9980 transitions. [2019-10-02 01:09:17,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:09:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 9980 transitions. [2019-10-02 01:09:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 01:09:17,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:17,319 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:09:17,320 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:17,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:17,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1031566485, now seen corresponding path program 1 times [2019-10-02 01:09:17,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:17,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:17,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:17,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:17,613 INFO L224 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) [2019-10-02 01:09:17,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:09:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:17,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:09:17,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:17,810 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 01:09:17,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:09:17,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 01:09:17,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:09:17,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:09:17,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:09:17,828 INFO L87 Difference]: Start difference. First operand 6536 states and 9980 transitions. Second operand 7 states. [2019-10-02 01:09:20,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:20,486 INFO L93 Difference]: Finished difference Result 14950 states and 24725 transitions. [2019-10-02 01:09:20,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:09:20,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-10-02 01:09:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:20,555 INFO L225 Difference]: With dead ends: 14950 [2019-10-02 01:09:20,555 INFO L226 Difference]: Without dead ends: 8027 [2019-10-02 01:09:20,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:09:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2019-10-02 01:09:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 7240. [2019-10-02 01:09:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7240 states. [2019-10-02 01:09:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7240 states to 7240 states and 8980 transitions. [2019-10-02 01:09:21,149 INFO L78 Accepts]: Start accepts. Automaton has 7240 states and 8980 transitions. Word has length 218 [2019-10-02 01:09:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:21,149 INFO L475 AbstractCegarLoop]: Abstraction has 7240 states and 8980 transitions. [2019-10-02 01:09:21,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:09:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7240 states and 8980 transitions. [2019-10-02 01:09:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 01:09:21,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:21,163 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:09:21,163 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1349983275, now seen corresponding path program 1 times [2019-10-02 01:09:21,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:21,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:21,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 01:09:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:09:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:09:21,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:09:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:09:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:09:21,388 INFO L87 Difference]: Start difference. First operand 7240 states and 8980 transitions. Second operand 4 states. [2019-10-02 01:09:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:23,147 INFO L93 Difference]: Finished difference Result 16591 states and 20695 transitions. [2019-10-02 01:09:23,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:09:23,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-10-02 01:09:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:23,191 INFO L225 Difference]: With dead ends: 16591 [2019-10-02 01:09:23,191 INFO L226 Difference]: Without dead ends: 9545 [2019-10-02 01:09:23,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-02 01:09:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2019-10-02 01:09:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 8398. [2019-10-02 01:09:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-10-02 01:09:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 10267 transitions. [2019-10-02 01:09:23,426 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 10267 transitions. Word has length 260 [2019-10-02 01:09:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:23,427 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 10267 transitions. [2019-10-02 01:09:23,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:09:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 10267 transitions. [2019-10-02 01:09:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 01:09:23,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:23,439 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:09:23,440 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -706378899, now seen corresponding path program 1 times [2019-10-02 01:09:23,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:23,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 73 proven. 5 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 01:09:23,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:23,812 INFO L224 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) [2019-10-02 01:09:23,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:09:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:23,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:09:23,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 165 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:24,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:09:24,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:09:24,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:09:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:09:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:09:24,245 INFO L87 Difference]: Start difference. First operand 8398 states and 10267 transitions. Second operand 11 states. [2019-10-02 01:09:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:26,698 INFO L93 Difference]: Finished difference Result 20016 states and 24524 transitions. [2019-10-02 01:09:26,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:09:26,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 269 [2019-10-02 01:09:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:26,734 INFO L225 Difference]: With dead ends: 20016 [2019-10-02 01:09:26,734 INFO L226 Difference]: Without dead ends: 11812 [2019-10-02 01:09:26,753 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:09:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11812 states. [2019-10-02 01:09:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11812 to 11244. [2019-10-02 01:09:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11244 states. [2019-10-02 01:09:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11244 states to 11244 states and 13679 transitions. [2019-10-02 01:09:27,076 INFO L78 Accepts]: Start accepts. Automaton has 11244 states and 13679 transitions. Word has length 269 [2019-10-02 01:09:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:27,077 INFO L475 AbstractCegarLoop]: Abstraction has 11244 states and 13679 transitions. [2019-10-02 01:09:27,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:09:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11244 states and 13679 transitions. [2019-10-02 01:09:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 01:09:27,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:27,088 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:09:27,088 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1198955447, now seen corresponding path program 1 times [2019-10-02 01:09:27,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:27,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:27,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:27,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:27,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 01:09:27,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:09:27,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:09:27,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:09:27,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:09:27,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:09:27,302 INFO L87 Difference]: Start difference. First operand 11244 states and 13679 transitions. Second operand 4 states. [2019-10-02 01:09:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:28,662 INFO L93 Difference]: Finished difference Result 26850 states and 32906 transitions. [2019-10-02 01:09:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:09:28,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-10-02 01:09:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:28,718 INFO L225 Difference]: With dead ends: 26850 [2019-10-02 01:09:28,718 INFO L226 Difference]: Without dead ends: 15800 [2019-10-02 01:09:28,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-02 01:09:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15800 states. [2019-10-02 01:09:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15800 to 15231. [2019-10-02 01:09:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15231 states. [2019-10-02 01:09:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15231 states to 15231 states and 18705 transitions. [2019-10-02 01:09:29,146 INFO L78 Accepts]: Start accepts. Automaton has 15231 states and 18705 transitions. Word has length 283 [2019-10-02 01:09:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:29,147 INFO L475 AbstractCegarLoop]: Abstraction has 15231 states and 18705 transitions. [2019-10-02 01:09:29,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:09:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15231 states and 18705 transitions. [2019-10-02 01:09:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 01:09:29,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:29,167 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 01:09:29,167 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1229796476, now seen corresponding path program 1 times [2019-10-02 01:09:29,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:29,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:29,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 01:09:29,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:29,495 INFO L224 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) [2019-10-02 01:09:29,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:09:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:29,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:09:29,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 01:09:29,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:09:29,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-10-02 01:09:29,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 01:09:29,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 01:09:29,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:09:29,762 INFO L87 Difference]: Start difference. First operand 15231 states and 18705 transitions. Second operand 8 states. [2019-10-02 01:09:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:33,097 INFO L93 Difference]: Finished difference Result 37925 states and 47900 transitions. [2019-10-02 01:09:33,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:09:33,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 334 [2019-10-02 01:09:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:33,165 INFO L225 Difference]: With dead ends: 37925 [2019-10-02 01:09:33,166 INFO L226 Difference]: Without dead ends: 22698 [2019-10-02 01:09:33,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:09:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22698 states. [2019-10-02 01:09:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22698 to 20817. [2019-10-02 01:09:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20817 states. [2019-10-02 01:09:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20817 states to 20817 states and 25651 transitions. [2019-10-02 01:09:34,436 INFO L78 Accepts]: Start accepts. Automaton has 20817 states and 25651 transitions. Word has length 334 [2019-10-02 01:09:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:34,437 INFO L475 AbstractCegarLoop]: Abstraction has 20817 states and 25651 transitions. [2019-10-02 01:09:34,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 01:09:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20817 states and 25651 transitions. [2019-10-02 01:09:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-02 01:09:34,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:34,480 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:09:34,480 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -265750592, now seen corresponding path program 1 times [2019-10-02 01:09:34,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:34,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:34,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 301 proven. 35 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 01:09:34,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:34,857 INFO L224 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) [2019-10-02 01:09:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:09:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:35,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 01:09:35,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:35,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:35,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:37,931 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-10-02 01:09:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 4 proven. 332 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 01:09:38,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:09:38,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-10-02 01:09:38,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:09:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:09:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-10-02 01:09:38,220 INFO L87 Difference]: Start difference. First operand 20817 states and 25651 transitions. Second operand 11 states. [2019-10-02 01:09:39,103 WARN L191 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-10-02 01:10:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:17,709 INFO L93 Difference]: Finished difference Result 49959 states and 62861 transitions. [2019-10-02 01:10:17,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 01:10:17,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 412 [2019-10-02 01:10:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:17,797 INFO L225 Difference]: With dead ends: 49959 [2019-10-02 01:10:17,797 INFO L226 Difference]: Without dead ends: 30684 [2019-10-02 01:10:17,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=157, Invalid=490, Unknown=3, NotChecked=0, Total=650 [2019-10-02 01:10:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30684 states. [2019-10-02 01:10:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30684 to 28582. [2019-10-02 01:10:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-10-02 01:10:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 35230 transitions. [2019-10-02 01:10:18,600 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 35230 transitions. Word has length 412 [2019-10-02 01:10:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:18,601 INFO L475 AbstractCegarLoop]: Abstraction has 28582 states and 35230 transitions. [2019-10-02 01:10:18,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:10:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 35230 transitions. [2019-10-02 01:10:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-10-02 01:10:18,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:18,680 INFO L411 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, 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, 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, 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] [2019-10-02 01:10:18,681 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:18,681 INFO L82 PathProgramCache]: Analyzing trace with hash 454542788, now seen corresponding path program 1 times [2019-10-02 01:10:18,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:18,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:18,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:18,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 343 proven. 95 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-10-02 01:10:19,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:10:19,119 INFO L224 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) [2019-10-02 01:10:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:10:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:10:19,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:10:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 642 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 01:10:19,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:10:19,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:10:19,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:10:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:10:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:10:19,557 INFO L87 Difference]: Start difference. First operand 28582 states and 35230 transitions. Second operand 7 states. [2019-10-02 01:10:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:21,389 INFO L93 Difference]: Finished difference Result 65042 states and 80595 transitions. [2019-10-02 01:10:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:10:21,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 533 [2019-10-02 01:10:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:21,451 INFO L225 Difference]: With dead ends: 65042 [2019-10-02 01:10:21,451 INFO L226 Difference]: Without dead ends: 36655 [2019-10-02 01:10:21,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:10:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36655 states. [2019-10-02 01:10:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36655 to 32812. [2019-10-02 01:10:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32812 states. [2019-10-02 01:10:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32812 states to 32812 states and 40325 transitions. [2019-10-02 01:10:22,288 INFO L78 Accepts]: Start accepts. Automaton has 32812 states and 40325 transitions. Word has length 533 [2019-10-02 01:10:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:22,289 INFO L475 AbstractCegarLoop]: Abstraction has 32812 states and 40325 transitions. [2019-10-02 01:10:22,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:10:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 32812 states and 40325 transitions. [2019-10-02 01:10:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2019-10-02 01:10:22,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:22,323 INFO L411 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:10:22,323 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:22,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1942775892, now seen corresponding path program 1 times [2019-10-02 01:10:22,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:22,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:22,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:22,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 515 proven. 72 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 01:10:22,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:10:22,827 INFO L224 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-10-02 01:10:22,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:23,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:10:23,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:10:23,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:23,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 10 proven. 577 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:10:24,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:10:24,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-10-02 01:10:24,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:10:24,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:10:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2019-10-02 01:10:24,892 INFO L87 Difference]: Start difference. First operand 32812 states and 40325 transitions. Second operand 11 states. [2019-10-02 01:10:37,034 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-10-02 01:11:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:10,863 INFO L93 Difference]: Finished difference Result 74444 states and 93532 transitions. [2019-10-02 01:11:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 01:11:10,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 557 [2019-10-02 01:11:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:11,886 INFO L225 Difference]: With dead ends: 74444 [2019-10-02 01:11:11,886 INFO L226 Difference]: Without dead ends: 43372 [2019-10-02 01:11:11,910 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 571 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=166, Invalid=529, Unknown=7, NotChecked=0, Total=702 [2019-10-02 01:11:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43372 states. [2019-10-02 01:11:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43372 to 41870. [2019-10-02 01:11:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41870 states. [2019-10-02 01:11:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41870 states to 41870 states and 51367 transitions. [2019-10-02 01:11:12,622 INFO L78 Accepts]: Start accepts. Automaton has 41870 states and 51367 transitions. Word has length 557 [2019-10-02 01:11:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:12,623 INFO L475 AbstractCegarLoop]: Abstraction has 41870 states and 51367 transitions. [2019-10-02 01:11:12,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:11:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 41870 states and 51367 transitions. [2019-10-02 01:11:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-10-02 01:11:12,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:12,696 INFO L411 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, 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, 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, 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] [2019-10-02 01:11:12,696 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:12,697 INFO L82 PathProgramCache]: Analyzing trace with hash -460648773, now seen corresponding path program 1 times [2019-10-02 01:11:12,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:12,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 278 proven. 233 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-10-02 01:11:14,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:14,842 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:11:14,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:15,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 01:11:15,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:11:15,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 01:11:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 667 proven. 2 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-02 01:11:15,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:11:15,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-10-02 01:11:15,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:11:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:11:15,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:11:15,593 INFO L87 Difference]: Start difference. First operand 41870 states and 51367 transitions. Second operand 15 states. [2019-10-02 01:11:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:20,580 INFO L93 Difference]: Finished difference Result 84615 states and 106503 transitions. [2019-10-02 01:11:20,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 01:11:20,580 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 573 [2019-10-02 01:11:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:20,666 INFO L225 Difference]: With dead ends: 84615 [2019-10-02 01:11:20,667 INFO L226 Difference]: Without dead ends: 42941 [2019-10-02 01:11:20,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=354, Invalid=906, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 01:11:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42941 states. [2019-10-02 01:11:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42941 to 42467. [2019-10-02 01:11:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42467 states. [2019-10-02 01:11:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42467 states to 42467 states and 51036 transitions. [2019-10-02 01:11:22,045 INFO L78 Accepts]: Start accepts. Automaton has 42467 states and 51036 transitions. Word has length 573 [2019-10-02 01:11:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:22,045 INFO L475 AbstractCegarLoop]: Abstraction has 42467 states and 51036 transitions. [2019-10-02 01:11:22,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:11:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42467 states and 51036 transitions. [2019-10-02 01:11:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2019-10-02 01:11:22,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:22,112 INFO L411 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, 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, 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, 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] [2019-10-02 01:11:22,112 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1049197127, now seen corresponding path program 1 times [2019-10-02 01:11:22,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:22,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:22,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:22,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 553 proven. 182 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 01:11:23,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:23,236 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:23,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:23,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:11:23,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:11:23,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:11:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 696 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-02 01:11:23,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:11:23,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 01:11:23,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:11:23,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:11:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:11:23,698 INFO L87 Difference]: Start difference. First operand 42467 states and 51036 transitions. Second operand 14 states. [2019-10-02 01:11:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:38,453 INFO L93 Difference]: Finished difference Result 104110 states and 126483 transitions. [2019-10-02 01:11:38,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-10-02 01:11:38,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 583 [2019-10-02 01:11:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:38,631 INFO L225 Difference]: With dead ends: 104110 [2019-10-02 01:11:38,631 INFO L226 Difference]: Without dead ends: 61265 [2019-10-02 01:11:38,702 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2561 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1059, Invalid=6251, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 01:11:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61265 states. [2019-10-02 01:11:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61265 to 56135. [2019-10-02 01:11:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56135 states. [2019-10-02 01:11:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56135 states to 56135 states and 67423 transitions. [2019-10-02 01:11:39,872 INFO L78 Accepts]: Start accepts. Automaton has 56135 states and 67423 transitions. Word has length 583 [2019-10-02 01:11:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:39,873 INFO L475 AbstractCegarLoop]: Abstraction has 56135 states and 67423 transitions. [2019-10-02 01:11:39,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:11:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 56135 states and 67423 transitions. [2019-10-02 01:11:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-10-02 01:11:39,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:39,960 INFO L411 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:11:39,960 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 775574876, now seen corresponding path program 1 times [2019-10-02 01:11:39,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:39,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:39,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:39,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:39,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1229 backedges. 397 proven. 198 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-10-02 01:11:40,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:40,687 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:41,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:41,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:11:41,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:11:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1229 backedges. 754 proven. 6 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-02 01:11:41,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:11:41,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-10-02 01:11:41,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:11:41,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:11:41,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:11:41,517 INFO L87 Difference]: Start difference. First operand 56135 states and 67423 transitions. Second operand 11 states. [2019-10-02 01:11:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:45,967 INFO L93 Difference]: Finished difference Result 117813 states and 142005 transitions. [2019-10-02 01:11:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 01:11:45,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 649 [2019-10-02 01:11:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:46,101 INFO L225 Difference]: With dead ends: 117813 [2019-10-02 01:11:46,101 INFO L226 Difference]: Without dead ends: 64756 [2019-10-02 01:11:46,171 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:11:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64756 states. [2019-10-02 01:11:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64756 to 61721. [2019-10-02 01:11:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61721 states. [2019-10-02 01:11:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61721 states to 61721 states and 73968 transitions. [2019-10-02 01:11:48,376 INFO L78 Accepts]: Start accepts. Automaton has 61721 states and 73968 transitions. Word has length 649 [2019-10-02 01:11:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:48,376 INFO L475 AbstractCegarLoop]: Abstraction has 61721 states and 73968 transitions. [2019-10-02 01:11:48,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:11:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 61721 states and 73968 transitions. [2019-10-02 01:11:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2019-10-02 01:11:48,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:48,436 INFO L411 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:11:48,437 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash 712366711, now seen corresponding path program 1 times [2019-10-02 01:11:48,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:48,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:48,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:48,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 583 proven. 144 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2019-10-02 01:11:49,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:49,154 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:49,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:49,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:11:49,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:11:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 1065 proven. 2 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:11:50,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:11:50,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:11:50,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:11:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:11:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:11:50,210 INFO L87 Difference]: Start difference. First operand 61721 states and 73968 transitions. Second operand 7 states. [2019-10-02 01:11:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:11:52,598 INFO L93 Difference]: Finished difference Result 113226 states and 135442 transitions. [2019-10-02 01:11:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:11:52,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 738 [2019-10-02 01:11:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:11:52,687 INFO L225 Difference]: With dead ends: 113226 [2019-10-02 01:11:52,687 INFO L226 Difference]: Without dead ends: 51701 [2019-10-02 01:11:52,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 742 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:11:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51701 states. [2019-10-02 01:11:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51701 to 51471. [2019-10-02 01:11:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51471 states. [2019-10-02 01:11:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51471 states to 51471 states and 59843 transitions. [2019-10-02 01:11:53,344 INFO L78 Accepts]: Start accepts. Automaton has 51471 states and 59843 transitions. Word has length 738 [2019-10-02 01:11:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:11:53,345 INFO L475 AbstractCegarLoop]: Abstraction has 51471 states and 59843 transitions. [2019-10-02 01:11:53,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:11:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 51471 states and 59843 transitions. [2019-10-02 01:11:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2019-10-02 01:11:53,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:11:53,390 INFO L411 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:11:53,390 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:11:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:11:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1621651928, now seen corresponding path program 1 times [2019-10-02 01:11:53,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:11:53,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:11:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:11:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 249 proven. 1072 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2019-10-02 01:11:56,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:11:56,392 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:11:56,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:11:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:11:56,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:11:56,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:11:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 1390 proven. 2 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2019-10-02 01:11:56,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:11:56,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-10-02 01:11:56,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 01:11:56,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 01:11:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-10-02 01:11:56,962 INFO L87 Difference]: Start difference. First operand 51471 states and 59843 transitions. Second operand 24 states. [2019-10-02 01:12:50,778 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-10-02 01:12:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:12:59,166 INFO L93 Difference]: Finished difference Result 141446 states and 171279 transitions. [2019-10-02 01:12:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2019-10-02 01:12:59,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 817 [2019-10-02 01:12:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:12:59,371 INFO L225 Difference]: With dead ends: 141446 [2019-10-02 01:12:59,371 INFO L226 Difference]: Without dead ends: 90591 [2019-10-02 01:12:59,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1246 GetRequests, 966 SyntacticMatches, 1 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33076 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=4904, Invalid=73776, Unknown=0, NotChecked=0, Total=78680 [2019-10-02 01:12:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90591 states. [2019-10-02 01:13:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90591 to 76675. [2019-10-02 01:13:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76675 states. [2019-10-02 01:13:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76675 states to 76675 states and 87698 transitions. [2019-10-02 01:13:00,559 INFO L78 Accepts]: Start accepts. Automaton has 76675 states and 87698 transitions. Word has length 817 [2019-10-02 01:13:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:13:00,559 INFO L475 AbstractCegarLoop]: Abstraction has 76675 states and 87698 transitions. [2019-10-02 01:13:00,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 01:13:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 76675 states and 87698 transitions. [2019-10-02 01:13:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2019-10-02 01:13:00,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:13:00,625 INFO L411 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, 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, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:13:00,625 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:13:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:13:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2057088326, now seen corresponding path program 1 times [2019-10-02 01:13:00,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:13:00,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:13:00,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:13:00,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:13:00,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:13:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:13:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 796 proven. 1710 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 01:13:04,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:13:04,583 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:13:04,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:13:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:13:04,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 01:13:04,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:13:04,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:04,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:13:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:13:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 1205 proven. 125 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2019-10-02 01:13:05,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:13:05,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 8] total 37 [2019-10-02 01:13:05,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 01:13:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 01:13:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 01:13:05,821 INFO L87 Difference]: Start difference. First operand 76675 states and 87698 transitions. Second operand 37 states. [2019-10-02 01:13:08,265 WARN L191 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-10-02 01:13:08,786 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-10-02 01:13:11,080 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-10-02 01:13:12,123 WARN L191 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-02 01:13:12,315 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 01:13:12,884 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 01:13:14,092 WARN L191 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-10-02 01:13:14,339 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-02 01:13:15,186 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-02 01:13:15,877 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-02 01:13:16,249 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-02 01:13:16,433 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-10-02 01:13:16,858 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-10-02 01:13:19,070 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-10-02 01:13:19,720 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-10-02 01:13:20,371 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-10-02 01:13:21,498 WARN L191 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2019-10-02 01:13:22,748 WARN L191 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-10-02 01:13:25,419 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-10-02 01:13:28,184 WARN L191 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-10-02 01:13:28,700 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-02 01:13:29,462 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-02 01:13:30,352 WARN L191 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-10-02 01:13:31,515 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-02 01:13:31,895 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2019-10-02 01:13:33,297 WARN L191 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-10-02 01:13:34,127 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-10-02 01:13:37,113 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-10-02 01:13:37,738 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-10-02 01:13:38,091 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 01:13:39,331 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-10-02 01:13:39,729 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-02 01:13:40,939 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-02 01:13:41,139 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-10-02 01:13:41,775 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-02 01:13:44,321 WARN L191 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-10-02 01:13:45,618 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-10-02 01:13:45,980 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-10-02 01:13:46,850 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-10-02 01:13:47,844 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-02 01:13:52,689 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-10-02 01:13:53,762 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-10-02 01:13:54,339 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-10-02 01:13:55,458 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-10-02 01:13:56,040 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-02 01:13:57,123 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-02 01:13:58,615 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-10-02 01:14:01,432 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-10-02 01:14:02,870 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-10-02 01:14:03,983 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-02 01:14:05,688 WARN L191 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-10-02 01:14:05,849 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-10-02 01:14:09,589 WARN L191 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-10-02 01:14:10,533 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 01:14:14,863 WARN L191 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2019-10-02 01:14:15,072 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-02 01:14:15,436 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-02 01:14:16,678 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-10-02 01:14:17,130 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-10-02 01:14:17,823 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-10-02 01:14:23,196 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-10-02 01:14:24,017 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-02 01:14:25,270 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-10-02 01:14:25,519 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-02 01:14:26,168 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-10-02 01:14:26,379 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-10-02 01:14:28,298 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-02 01:14:28,915 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-02 01:14:30,322 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-02 01:14:31,316 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-10-02 01:14:32,184 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-10-02 01:14:32,400 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-10-02 01:14:32,689 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-02 01:14:32,886 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-10-02 01:14:34,217 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-02 01:14:34,406 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 01:14:35,154 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-10-02 01:14:35,731 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-02 01:14:35,952 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-10-02 01:14:37,368 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-02 01:14:38,779 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-10-02 01:14:39,405 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-02 01:14:39,633 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-02 01:14:40,173 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-10-02 01:14:40,637 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-02 01:14:41,209 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 31 [2019-10-02 01:14:56,137 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-02 01:14:58,235 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-02 01:14:59,162 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-02 01:15:07,105 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-02 01:15:15,395 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-02 01:15:28,066 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-02 01:15:28,948 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-10-02 01:15:29,211 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-10-02 01:15:30,965 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-02 01:15:31,445 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-02 01:15:32,384 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-02 01:15:33,019 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-02 01:15:40,671 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-02 01:15:42,621 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-02 01:15:43,752 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-02 01:15:46,394 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-10-02 01:15:46,587 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-02 01:15:51,372 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-10-02 01:15:51,669 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-02 01:15:52,887 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-10-02 01:15:53,249 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-02 01:15:53,865 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-02 01:16:13,059 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-02 01:16:13,253 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-10-02 01:16:17,057 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-10-02 01:16:21,675 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-10-02 01:16:39,123 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-10-02 01:16:45,645 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-02 01:16:45,856 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-10-02 01:16:48,532 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-10-02 01:16:50,977 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-10-02 01:16:51,251 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-10-02 01:16:57,352 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-10-02 01:17:06,767 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-10-02 01:17:13,575 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-02 01:17:14,507 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-02 01:17:15,984 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-02 01:17:16,619 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-02 01:17:17,137 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-02 01:17:17,841 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-02 01:17:18,601 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-02 01:17:22,581 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-02 01:17:23,441 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-10-02 01:17:24,804 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-10-02 01:17:26,640 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-02 01:17:30,646 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-02 01:17:32,440 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-10-02 01:17:32,881 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-10-02 01:17:33,338 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-10-02 01:17:43,600 WARN L191 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-10-02 01:17:45,800 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-02 01:17:48,873 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-02 01:17:49,112 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-02 01:17:54,345 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-02 01:17:58,366 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-10-02 01:17:58,560 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-02 01:17:59,162 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-10-02 01:17:59,803 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-02 01:18:01,687 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-02 01:18:03,511 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-02 01:18:04,068 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-10-02 01:18:04,326 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-10-02 01:18:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:18:05,551 INFO L93 Difference]: Finished difference Result 231285 states and 290228 transitions. [2019-10-02 01:18:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 527 states. [2019-10-02 01:18:05,552 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 930 [2019-10-02 01:18:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:18:06,456 INFO L225 Difference]: With dead ends: 231285 [2019-10-02 01:18:06,456 INFO L226 Difference]: Without dead ends: 159782 [2019-10-02 01:18:06,696 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1534 GetRequests, 975 SyntacticMatches, 1 SemanticMatches, 558 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 146384 ImplicationChecksByTransitivity, 74.9s TimeCoverageRelationStatistics Valid=27884, Invalid=285151, Unknown=5, NotChecked=0, Total=313040 [2019-10-02 01:18:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159782 states. [2019-10-02 01:18:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159782 to 151803. [2019-10-02 01:18:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151803 states. [2019-10-02 01:18:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151803 states to 151803 states and 191278 transitions. [2019-10-02 01:18:10,756 INFO L78 Accepts]: Start accepts. Automaton has 151803 states and 191278 transitions. Word has length 930 [2019-10-02 01:18:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:18:10,756 INFO L475 AbstractCegarLoop]: Abstraction has 151803 states and 191278 transitions. [2019-10-02 01:18:10,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 01:18:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 151803 states and 191278 transitions. [2019-10-02 01:18:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1087 [2019-10-02 01:18:14,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:18:14,320 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:18:14,320 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:18:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:18:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1590997382, now seen corresponding path program 1 times [2019-10-02 01:18:14,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:18:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:18:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:18:14,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:18:14,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:18:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:18:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 243 proven. 2263 refuted. 0 times theorem prover too weak. 1377 trivial. 0 not checked. [2019-10-02 01:18:17,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:18:17,315 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:18:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:18:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:18:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1585 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 01:18:17,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:18:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3883 backedges. 2299 proven. 2 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2019-10-02 01:18:18,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:18:18,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 5] total 30 [2019-10-02 01:18:18,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 01:18:18,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 01:18:18,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2019-10-02 01:18:18,640 INFO L87 Difference]: Start difference. First operand 151803 states and 191278 transitions. Second operand 30 states. [2019-10-02 01:18:57,204 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-10-02 01:19:01,950 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-10-02 01:19:14,001 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-10-02 01:19:17,492 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-10-02 01:19:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:19:32,951 INFO L93 Difference]: Finished difference Result 355571 states and 454056 transitions. [2019-10-02 01:19:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 270 states. [2019-10-02 01:19:32,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1086 [2019-10-02 01:19:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:19:32,953 INFO L225 Difference]: With dead ends: 355571 [2019-10-02 01:19:32,953 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:19:33,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1536 GetRequests, 1250 SyntacticMatches, 1 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34370 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=5626, Invalid=76456, Unknown=0, NotChecked=0, Total=82082 [2019-10-02 01:19:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:19:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:19:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:19:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:19:33,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1086 [2019-10-02 01:19:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:19:33,512 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:19:33,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 01:19:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:19:33,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:19:33,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:19:34,130 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67