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/Problem18_label32.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:35:49,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:35:49,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:35:49,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:35:49,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:35:49,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:35:49,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:35:49,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:35:49,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:35:49,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:35:49,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:35:49,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:35:49,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:35:49,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:35:49,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:35:49,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:35:49,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:35:49,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:35:49,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:35:49,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:35:49,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:35:49,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:35:49,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:35:49,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:35:49,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:35:49,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:35:49,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:35:49,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:35:49,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:35:49,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:35:49,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:35:49,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:35:49,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:35:49,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:35:49,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:35:49,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:35:49,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:35:49,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:35:49,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:35:49,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:35:49,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:35:49,577 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-09-07 22:35:49,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:35:49,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:35:49,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:35:49,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:35:49,603 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:35:49,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:35:49,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:35:49,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:35:49,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:35:49,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:35:49,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:35:49,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:35:49,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:35:49,606 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:35:49,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:35:49,607 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:35:49,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:35:49,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:35:49,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:35:49,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:35:49,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:35:49,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:35:49,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:35:49,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:35:49,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:35:49,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:35:49,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:35:49,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:35:49,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:35:49,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:35:49,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:35:49,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:35:49,672 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:35:49,672 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:35:49,673 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label32.c [2019-09-07 22:35:49,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d361a4496/41769604f33447e5bde7914cc312cc38/FLAG67946e7f0 [2019-09-07 22:35:50,486 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:35:50,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label32.c [2019-09-07 22:35:50,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d361a4496/41769604f33447e5bde7914cc312cc38/FLAG67946e7f0 [2019-09-07 22:35:50,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d361a4496/41769604f33447e5bde7914cc312cc38 [2019-09-07 22:35:50,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:35:50,594 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:35:50,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:35:50,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:35:50,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:35:50,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:35:50" (1/1) ... [2019-09-07 22:35:50,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262768b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:50, skipping insertion in model container [2019-09-07 22:35:50,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:35:50" (1/1) ... [2019-09-07 22:35:50,613 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:35:50,744 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:35:52,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:35:52,260 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:35:52,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:35:52,776 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:35:52,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52 WrapperNode [2019-09-07 22:35:52,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:35:52,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:35:52,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:35:52,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:35:52,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:52,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:52,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:52,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:53,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:53,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:53,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (1/1) ... [2019-09-07 22:35:53,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:35:53,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:35:53,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:35:53,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:35:53,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (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-09-07 22:35:53,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:35:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:35:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:35:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:35:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:35:53,175 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:35:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:35:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:35:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:35:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:35:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:35:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:35:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:35:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:35:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:35:56,716 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:35:56,719 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:35:56,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:35:56 BoogieIcfgContainer [2019-09-07 22:35:56,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:35:56,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:35:56,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:35:56,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:35:56,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:35:50" (1/3) ... [2019-09-07 22:35:56,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fe2890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:35:56, skipping insertion in model container [2019-09-07 22:35:56,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:35:52" (2/3) ... [2019-09-07 22:35:56,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fe2890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:35:56, skipping insertion in model container [2019-09-07 22:35:56,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:35:56" (3/3) ... [2019-09-07 22:35:56,736 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label32.c [2019-09-07 22:35:56,746 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:35:56,755 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:35:56,773 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:35:56,820 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:35:56,820 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:35:56,820 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:35:56,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:35:56,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:35:56,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:35:56,821 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:35:56,821 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:35:56,821 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:35:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:35:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 22:35:56,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:35:56,865 INFO L399 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] [2019-09-07 22:35:56,867 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:35:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:35:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash 255374729, now seen corresponding path program 1 times [2019-09-07 22:35:56,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:35:56,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:35:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:56,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:57,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:35:57,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:35:57,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:35:57,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:35:57,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:35:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:35:57,192 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-09-07 22:36:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:04,621 INFO L93 Difference]: Finished difference Result 2970 states and 5743 transitions. [2019-09-07 22:36:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:36:04,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 22:36:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:04,678 INFO L225 Difference]: With dead ends: 2970 [2019-09-07 22:36:04,678 INFO L226 Difference]: Without dead ends: 2114 [2019-09-07 22:36:04,699 INFO L628 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-09-07 22:36:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-09-07 22:36:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-09-07 22:36:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-09-07 22:36:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3320 transitions. [2019-09-07 22:36:04,910 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3320 transitions. Word has length 34 [2019-09-07 22:36:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:04,911 INFO L475 AbstractCegarLoop]: Abstraction has 2114 states and 3320 transitions. [2019-09-07 22:36:04,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:36:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3320 transitions. [2019-09-07 22:36:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 22:36:04,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:04,918 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:36:04,918 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash -139221275, now seen corresponding path program 1 times [2019-09-07 22:36:04,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:04,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:05,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:05,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:36:05,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:36:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:36:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:36:05,191 INFO L87 Difference]: Start difference. First operand 2114 states and 3320 transitions. Second operand 5 states. [2019-09-07 22:36:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:11,285 INFO L93 Difference]: Finished difference Result 6436 states and 10244 transitions. [2019-09-07 22:36:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:36:11,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-07 22:36:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:11,315 INFO L225 Difference]: With dead ends: 6436 [2019-09-07 22:36:11,315 INFO L226 Difference]: Without dead ends: 4328 [2019-09-07 22:36:11,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:36:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4328 states. [2019-09-07 22:36:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4328 to 4296. [2019-09-07 22:36:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4296 states. [2019-09-07 22:36:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6416 transitions. [2019-09-07 22:36:11,486 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6416 transitions. Word has length 103 [2019-09-07 22:36:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:11,488 INFO L475 AbstractCegarLoop]: Abstraction has 4296 states and 6416 transitions. [2019-09-07 22:36:11,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:36:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6416 transitions. [2019-09-07 22:36:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 22:36:11,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:11,498 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:36:11,499 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash -544312976, now seen corresponding path program 1 times [2019-09-07 22:36:11,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:11,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:11,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:11,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:36:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:36:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:36:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:36:11,716 INFO L87 Difference]: Start difference. First operand 4296 states and 6416 transitions. Second operand 6 states. [2019-09-07 22:36:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:17,064 INFO L93 Difference]: Finished difference Result 10829 states and 16211 transitions. [2019-09-07 22:36:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:36:17,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-07 22:36:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:17,102 INFO L225 Difference]: With dead ends: 10829 [2019-09-07 22:36:17,102 INFO L226 Difference]: Without dead ends: 6539 [2019-09-07 22:36:17,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:36:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2019-09-07 22:36:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6505. [2019-09-07 22:36:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6505 states. [2019-09-07 22:36:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 8361 transitions. [2019-09-07 22:36:17,333 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 8361 transitions. Word has length 130 [2019-09-07 22:36:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:17,334 INFO L475 AbstractCegarLoop]: Abstraction has 6505 states and 8361 transitions. [2019-09-07 22:36:17,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:36:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 8361 transitions. [2019-09-07 22:36:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 22:36:17,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:17,339 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:36:17,339 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:17,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1162644732, now seen corresponding path program 1 times [2019-09-07 22:36:17,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:17,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:17,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:17,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:17,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:36:17,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:36:17,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:36:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:36:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:36:17,514 INFO L87 Difference]: Start difference. First operand 6505 states and 8361 transitions. Second operand 4 states. [2019-09-07 22:36:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:23,654 INFO L93 Difference]: Finished difference Result 25811 states and 33996 transitions. [2019-09-07 22:36:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:36:23,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-07 22:36:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:23,735 INFO L225 Difference]: With dead ends: 25811 [2019-09-07 22:36:23,736 INFO L226 Difference]: Without dead ends: 19312 [2019-09-07 22:36:23,757 INFO L628 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-09-07 22:36:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19312 states. [2019-09-07 22:36:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19312 to 19312. [2019-09-07 22:36:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19312 states. [2019-09-07 22:36:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19312 states to 19312 states and 23985 transitions. [2019-09-07 22:36:24,313 INFO L78 Accepts]: Start accepts. Automaton has 19312 states and 23985 transitions. Word has length 140 [2019-09-07 22:36:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:24,315 INFO L475 AbstractCegarLoop]: Abstraction has 19312 states and 23985 transitions. [2019-09-07 22:36:24,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:36:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19312 states and 23985 transitions. [2019-09-07 22:36:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-07 22:36:24,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:24,328 INFO L399 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:36:24,329 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash -474938195, now seen corresponding path program 1 times [2019-09-07 22:36:24,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:24,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:24,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:24,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:25,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:36:25,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:36:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:25,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:36:25,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:36:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 22:36:25,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:36:25,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-09-07 22:36:25,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:36:25,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:36:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:36:25,949 INFO L87 Difference]: Start difference. First operand 19312 states and 23985 transitions. Second operand 14 states. [2019-09-07 22:36:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:38,567 INFO L93 Difference]: Finished difference Result 54996 states and 70445 transitions. [2019-09-07 22:36:38,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 22:36:38,567 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 354 [2019-09-07 22:36:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:38,730 INFO L225 Difference]: With dead ends: 54996 [2019-09-07 22:36:38,730 INFO L226 Difference]: Without dead ends: 35119 [2019-09-07 22:36:38,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 22:36:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35119 states. [2019-09-07 22:36:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35119 to 32934. [2019-09-07 22:36:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32934 states. [2019-09-07 22:36:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32934 states to 32934 states and 37096 transitions. [2019-09-07 22:36:39,628 INFO L78 Accepts]: Start accepts. Automaton has 32934 states and 37096 transitions. Word has length 354 [2019-09-07 22:36:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:39,629 INFO L475 AbstractCegarLoop]: Abstraction has 32934 states and 37096 transitions. [2019-09-07 22:36:39,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:36:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32934 states and 37096 transitions. [2019-09-07 22:36:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-09-07 22:36:39,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:39,642 INFO L399 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-09-07 22:36:39,642 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1778002119, now seen corresponding path program 1 times [2019-09-07 22:36:39,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:39,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:39,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:39,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 189 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:36:41,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:36:41,041 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:36:41,068 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-09-07 22:36:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:41,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:36:41,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:36:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 298 proven. 2 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 22:36:41,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:36:41,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 22:36:41,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:36:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:36:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:36:41,369 INFO L87 Difference]: Start difference. First operand 32934 states and 37096 transitions. Second operand 14 states. [2019-09-07 22:36:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:55,466 INFO L93 Difference]: Finished difference Result 89491 states and 102433 transitions. [2019-09-07 22:36:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 22:36:55,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 401 [2019-09-07 22:36:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:55,705 INFO L225 Difference]: With dead ends: 89491 [2019-09-07 22:36:55,707 INFO L226 Difference]: Without dead ends: 54423 [2019-09-07 22:36:55,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=809, Invalid=3097, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 22:36:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54423 states. [2019-09-07 22:36:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54423 to 47262. [2019-09-07 22:36:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47262 states. [2019-09-07 22:36:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47262 states to 47262 states and 51285 transitions. [2019-09-07 22:36:56,774 INFO L78 Accepts]: Start accepts. Automaton has 47262 states and 51285 transitions. Word has length 401 [2019-09-07 22:36:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:56,776 INFO L475 AbstractCegarLoop]: Abstraction has 47262 states and 51285 transitions. [2019-09-07 22:36:56,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:36:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 47262 states and 51285 transitions. [2019-09-07 22:36:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-07 22:36:56,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:56,800 INFO L399 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 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] [2019-09-07 22:36:56,800 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 622810170, now seen corresponding path program 1 times [2019-09-07 22:36:56,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:56,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:56,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:56,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:56,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 222 proven. 320 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 22:36:57,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:36:57,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:36:57,387 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-09-07 22:36:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:57,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:36:57,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:36:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 620 proven. 2 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-07 22:36:57,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:36:57,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 22:36:57,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:36:57,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:36:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:36:57,878 INFO L87 Difference]: Start difference. First operand 47262 states and 51285 transitions. Second operand 11 states. [2019-09-07 22:37:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:08,527 INFO L93 Difference]: Finished difference Result 98125 states and 106850 transitions. [2019-09-07 22:37:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 22:37:08,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 481 [2019-09-07 22:37:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:08,664 INFO L225 Difference]: With dead ends: 98125 [2019-09-07 22:37:08,664 INFO L226 Difference]: Without dead ends: 50869 [2019-09-07 22:37:08,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 489 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-07 22:37:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50869 states. [2019-09-07 22:37:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50869 to 46567. [2019-09-07 22:37:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46567 states. [2019-09-07 22:37:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46567 states to 46567 states and 50214 transitions. [2019-09-07 22:37:10,957 INFO L78 Accepts]: Start accepts. Automaton has 46567 states and 50214 transitions. Word has length 481 [2019-09-07 22:37:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:10,959 INFO L475 AbstractCegarLoop]: Abstraction has 46567 states and 50214 transitions. [2019-09-07 22:37:10,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:37:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46567 states and 50214 transitions. [2019-09-07 22:37:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-09-07 22:37:10,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:10,985 INFO L399 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-09-07 22:37:10,986 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -501742846, now seen corresponding path program 1 times [2019-09-07 22:37:10,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:10,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 205 proven. 194 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 22:37:11,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:11,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:37:11,760 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-09-07 22:37:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:11,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:37:11,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 489 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 22:37:12,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:12,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:37:12,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:37:12,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:37:12,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:37:12,137 INFO L87 Difference]: Start difference. First operand 46567 states and 50214 transitions. Second operand 9 states. [2019-09-07 22:37:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:23,714 INFO L93 Difference]: Finished difference Result 138660 states and 156319 transitions. [2019-09-07 22:37:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:37:23,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 560 [2019-09-07 22:37:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:24,006 INFO L225 Difference]: With dead ends: 138660 [2019-09-07 22:37:24,006 INFO L226 Difference]: Without dead ends: 90652 [2019-09-07 22:37:24,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:37:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90652 states. [2019-09-07 22:37:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90652 to 87763. [2019-09-07 22:37:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87763 states. [2019-09-07 22:37:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87763 states to 87763 states and 98299 transitions. [2019-09-07 22:37:25,514 INFO L78 Accepts]: Start accepts. Automaton has 87763 states and 98299 transitions. Word has length 560 [2019-09-07 22:37:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:25,515 INFO L475 AbstractCegarLoop]: Abstraction has 87763 states and 98299 transitions. [2019-09-07 22:37:25,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:37:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 87763 states and 98299 transitions. [2019-09-07 22:37:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2019-09-07 22:37:25,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:25,558 INFO L399 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:37:25,558 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash -2030475065, now seen corresponding path program 1 times [2019-09-07 22:37:25,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:25,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-09-07 22:37:26,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:37:26,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:37:26,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:37:26,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:37:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:37:26,580 INFO L87 Difference]: Start difference. First operand 87763 states and 98299 transitions. Second operand 4 states. [2019-09-07 22:37:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:32,404 INFO L93 Difference]: Finished difference Result 186104 states and 209294 transitions. [2019-09-07 22:37:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:37:32,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 737 [2019-09-07 22:37:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:32,733 INFO L225 Difference]: With dead ends: 186104 [2019-09-07 22:37:32,734 INFO L226 Difference]: Without dead ends: 99049 [2019-09-07 22:37:32,892 INFO L628 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-09-07 22:37:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99049 states. [2019-09-07 22:37:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99049 to 96221. [2019-09-07 22:37:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96221 states. [2019-09-07 22:37:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96221 states to 96221 states and 106786 transitions. [2019-09-07 22:37:34,092 INFO L78 Accepts]: Start accepts. Automaton has 96221 states and 106786 transitions. Word has length 737 [2019-09-07 22:37:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:34,094 INFO L475 AbstractCegarLoop]: Abstraction has 96221 states and 106786 transitions. [2019-09-07 22:37:34,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:37:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 96221 states and 106786 transitions. [2019-09-07 22:37:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1141 [2019-09-07 22:37:34,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:34,266 INFO L399 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:37:34,266 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1879097100, now seen corresponding path program 1 times [2019-09-07 22:37:34,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:34,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 205 proven. 350 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 22:37:37,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:37,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:37,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:37:37,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 645 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-07 22:37:37,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:37,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:37:37,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:37:37,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:37:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:37:37,917 INFO L87 Difference]: Start difference. First operand 96221 states and 106786 transitions. Second operand 9 states. [2019-09-07 22:37:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:47,503 INFO L93 Difference]: Finished difference Result 205155 states and 238948 transitions. [2019-09-07 22:37:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 22:37:47,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1140 [2019-09-07 22:37:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:47,850 INFO L225 Difference]: With dead ends: 205155 [2019-09-07 22:37:47,850 INFO L226 Difference]: Without dead ends: 109650 [2019-09-07 22:37:48,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1169 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 22:37:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109650 states. [2019-09-07 22:37:49,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109650 to 109330. [2019-09-07 22:37:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109330 states. [2019-09-07 22:37:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109330 states to 109330 states and 128385 transitions. [2019-09-07 22:37:49,991 INFO L78 Accepts]: Start accepts. Automaton has 109330 states and 128385 transitions. Word has length 1140 [2019-09-07 22:37:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:49,993 INFO L475 AbstractCegarLoop]: Abstraction has 109330 states and 128385 transitions. [2019-09-07 22:37:49,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:37:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 109330 states and 128385 transitions. [2019-09-07 22:37:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2019-09-07 22:37:50,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:50,256 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:37:50,256 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash 736370484, now seen corresponding path program 1 times [2019-09-07 22:37:50,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:50,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:50,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 604 proven. 262 refuted. 0 times theorem prover too weak. 1845 trivial. 0 not checked. [2019-09-07 22:37:53,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:53,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:37:53,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:54,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1992 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:37:54,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1692 proven. 2 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2019-09-07 22:37:55,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:55,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:37:55,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:37:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:37:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:37:55,490 INFO L87 Difference]: Start difference. First operand 109330 states and 128385 transitions. Second operand 9 states. [2019-09-07 22:38:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:16,852 INFO L93 Difference]: Finished difference Result 243780 states and 293158 transitions. [2019-09-07 22:38:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 22:38:16,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1495 [2019-09-07 22:38:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:17,298 INFO L225 Difference]: With dead ends: 243780 [2019-09-07 22:38:17,299 INFO L226 Difference]: Without dead ends: 134390 [2019-09-07 22:38:17,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1582 GetRequests, 1534 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=1966, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 22:38:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134390 states. [2019-09-07 22:38:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134390 to 133369. [2019-09-07 22:38:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133369 states. [2019-09-07 22:38:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133369 states to 133369 states and 154426 transitions. [2019-09-07 22:38:19,729 INFO L78 Accepts]: Start accepts. Automaton has 133369 states and 154426 transitions. Word has length 1495 [2019-09-07 22:38:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:19,730 INFO L475 AbstractCegarLoop]: Abstraction has 133369 states and 154426 transitions. [2019-09-07 22:38:19,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:38:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 133369 states and 154426 transitions. [2019-09-07 22:38:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1316 [2019-09-07 22:38:19,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:19,858 INFO L399 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:38:19,858 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1501819139, now seen corresponding path program 1 times [2019-09-07 22:38:19,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:19,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:19,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:19,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 360 proven. 525 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 22:38:21,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:21,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:38:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:21,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:38:21,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:21,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:38:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2019-09-07 22:38:23,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:38:23,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 22:38:23,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:38:23,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:38:23,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:38:23,051 INFO L87 Difference]: Start difference. First operand 133369 states and 154426 transitions. Second operand 10 states. [2019-09-07 22:38:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:41,500 INFO L93 Difference]: Finished difference Result 293230 states and 340074 transitions. [2019-09-07 22:38:41,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 22:38:41,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1315 [2019-09-07 22:38:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:41,912 INFO L225 Difference]: With dead ends: 293230 [2019-09-07 22:38:41,912 INFO L226 Difference]: Without dead ends: 165463 [2019-09-07 22:38:42,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1388 GetRequests, 1348 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 22:38:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165463 states. [2019-09-07 22:38:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165463 to 161823. [2019-09-07 22:38:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161823 states. [2019-09-07 22:38:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161823 states to 161823 states and 185777 transitions. [2019-09-07 22:38:48,633 INFO L78 Accepts]: Start accepts. Automaton has 161823 states and 185777 transitions. Word has length 1315 [2019-09-07 22:38:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:48,634 INFO L475 AbstractCegarLoop]: Abstraction has 161823 states and 185777 transitions. [2019-09-07 22:38:48,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:38:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 161823 states and 185777 transitions. [2019-09-07 22:38:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2309 [2019-09-07 22:38:48,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:48,910 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:38:48,911 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:48,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1469702096, now seen corresponding path program 1 times [2019-09-07 22:38:48,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:48,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:48,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5012 backedges. 392 proven. 3881 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2019-09-07 22:38:58,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:58,240 INFO L223 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:38:58,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:58,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 2843 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:38:58,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:58,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:39:00,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5012 backedges. 3603 proven. 2 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2019-09-07 22:39:00,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:00,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-09-07 22:39:00,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 22:39:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 22:39:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-09-07 22:39:00,586 INFO L87 Difference]: Start difference. First operand 161823 states and 185777 transitions. Second operand 25 states. [2019-09-07 22:39:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:39,588 INFO L93 Difference]: Finished difference Result 319748 states and 368494 transitions. [2019-09-07 22:39:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-07 22:39:39,588 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 2308 [2019-09-07 22:39:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:39,995 INFO L225 Difference]: With dead ends: 319748 [2019-09-07 22:39:39,995 INFO L226 Difference]: Without dead ends: 159343 [2019-09-07 22:39:40,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2543 GetRequests, 2405 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7025 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2777, Invalid=16129, Unknown=0, NotChecked=0, Total=18906 [2019-09-07 22:39:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159343 states. [2019-09-07 22:39:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159343 to 157999. [2019-09-07 22:39:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157999 states. [2019-09-07 22:39:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157999 states to 157999 states and 176950 transitions. [2019-09-07 22:39:42,549 INFO L78 Accepts]: Start accepts. Automaton has 157999 states and 176950 transitions. Word has length 2308 [2019-09-07 22:39:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:42,551 INFO L475 AbstractCegarLoop]: Abstraction has 157999 states and 176950 transitions. [2019-09-07 22:39:42,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 22:39:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 157999 states and 176950 transitions. [2019-09-07 22:39:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2324 [2019-09-07 22:39:43,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:43,552 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:39:43,552 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash 811456535, now seen corresponding path program 1 times [2019-09-07 22:39:43,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:43,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:43,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5048 backedges. 1099 proven. 298 refuted. 0 times theorem prover too weak. 3651 trivial. 0 not checked. [2019-09-07 22:39:47,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:47,291 INFO L223 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-09-07 22:39:47,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:47,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 2857 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:39:47,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5048 backedges. 3188 proven. 2 refuted. 0 times theorem prover too weak. 1858 trivial. 0 not checked. [2019-09-07 22:39:50,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:50,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:39:50,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:39:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:39:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:39:50,725 INFO L87 Difference]: Start difference. First operand 157999 states and 176950 transitions. Second operand 9 states. [2019-09-07 22:40:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:04,416 INFO L93 Difference]: Finished difference Result 313117 states and 360854 transitions. [2019-09-07 22:40:04,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 22:40:04,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2323 [2019-09-07 22:40:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:05,019 INFO L225 Difference]: With dead ends: 313117 [2019-09-07 22:40:05,019 INFO L226 Difference]: Without dead ends: 158513 [2019-09-07 22:40:05,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2354 GetRequests, 2334 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 22:40:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158513 states. [2019-09-07 22:40:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158513 to 146748. [2019-09-07 22:40:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146748 states. [2019-09-07 22:40:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146748 states to 146748 states and 157401 transitions. [2019-09-07 22:40:07,815 INFO L78 Accepts]: Start accepts. Automaton has 146748 states and 157401 transitions. Word has length 2323 [2019-09-07 22:40:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:07,816 INFO L475 AbstractCegarLoop]: Abstraction has 146748 states and 157401 transitions. [2019-09-07 22:40:07,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:40:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 146748 states and 157401 transitions. [2019-09-07 22:40:08,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2370 [2019-09-07 22:40:08,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:08,031 INFO L399 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:40:08,032 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1084394892, now seen corresponding path program 1 times [2019-09-07 22:40:08,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5689 backedges. 1015 proven. 1972 refuted. 0 times theorem prover too weak. 2702 trivial. 0 not checked. [2019-09-07 22:40:14,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:14,883 INFO L223 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-09-07 22:40:14,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:15,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:40:15,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5689 backedges. 3420 proven. 2 refuted. 0 times theorem prover too weak. 2267 trivial. 0 not checked. [2019-09-07 22:40:17,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:17,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 22:40:17,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:40:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:40:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:40:17,425 INFO L87 Difference]: Start difference. First operand 146748 states and 157401 transitions. Second operand 14 states. [2019-09-07 22:40:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:30,956 INFO L93 Difference]: Finished difference Result 281768 states and 298676 transitions. [2019-09-07 22:40:30,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 22:40:30,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 2369 [2019-09-07 22:40:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:31,282 INFO L225 Difference]: With dead ends: 281768 [2019-09-07 22:40:31,282 INFO L226 Difference]: Without dead ends: 142100 [2019-09-07 22:40:31,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2466 GetRequests, 2410 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=678, Invalid=2514, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 22:40:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142100 states. [2019-09-07 22:40:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142100 to 140612. [2019-09-07 22:40:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140612 states. [2019-09-07 22:40:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140612 states to 140612 states and 145664 transitions. [2019-09-07 22:40:33,635 INFO L78 Accepts]: Start accepts. Automaton has 140612 states and 145664 transitions. Word has length 2369 [2019-09-07 22:40:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:33,636 INFO L475 AbstractCegarLoop]: Abstraction has 140612 states and 145664 transitions. [2019-09-07 22:40:33,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:40:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 140612 states and 145664 transitions. [2019-09-07 22:40:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2183 [2019-09-07 22:40:33,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:33,809 INFO L399 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:40:33,810 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:33,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1342126277, now seen corresponding path program 1 times [2019-09-07 22:40:33,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:33,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:33,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4171 backedges. 1394 proven. 1779 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2019-09-07 22:40:41,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:41,267 INFO L223 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-09-07 22:40:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:41,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:40:41,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:41,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4171 backedges. 2215 proven. 2 refuted. 0 times theorem prover too weak. 1954 trivial. 0 not checked. [2019-09-07 22:40:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:43,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 22:40:43,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 22:40:43,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 22:40:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-07 22:40:43,611 INFO L87 Difference]: Start difference. First operand 140612 states and 145664 transitions. Second operand 21 states. [2019-09-07 22:41:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:41:11,327 INFO L93 Difference]: Finished difference Result 275290 states and 286086 transitions. [2019-09-07 22:41:11,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-07 22:41:11,328 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 2182 [2019-09-07 22:41:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:41:11,615 INFO L225 Difference]: With dead ends: 275290 [2019-09-07 22:41:11,615 INFO L226 Difference]: Without dead ends: 140314 [2019-09-07 22:41:11,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2334 GetRequests, 2246 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1071, Invalid=6939, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 22:41:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140314 states. [2019-09-07 22:41:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140314 to 135543. [2019-09-07 22:41:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135543 states. [2019-09-07 22:41:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135543 states to 135543 states and 140159 transitions. [2019-09-07 22:41:13,636 INFO L78 Accepts]: Start accepts. Automaton has 135543 states and 140159 transitions. Word has length 2182 [2019-09-07 22:41:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:41:13,637 INFO L475 AbstractCegarLoop]: Abstraction has 135543 states and 140159 transitions. [2019-09-07 22:41:13,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 22:41:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 135543 states and 140159 transitions. [2019-09-07 22:41:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2437 [2019-09-07 22:41:13,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:41:13,804 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:41:13,804 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:41:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:41:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2043875306, now seen corresponding path program 1 times [2019-09-07 22:41:13,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:41:13,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:41:13,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:13,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:13,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5592 backedges. 2000 proven. 2 refuted. 0 times theorem prover too weak. 3590 trivial. 0 not checked. [2019-09-07 22:41:17,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:41:17,973 INFO L223 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-09-07 22:41:17,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:18,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 2972 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:41:18,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:41:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5592 backedges. 2000 proven. 2 refuted. 0 times theorem prover too weak. 3590 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:41:23,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:41:23,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 22:41:23,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:41:23,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:41:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:41:23,526 INFO L87 Difference]: Start difference. First operand 135543 states and 140159 transitions. Second operand 7 states. [2019-09-07 22:41:28,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:41:28,905 INFO L93 Difference]: Finished difference Result 274712 states and 284317 transitions. [2019-09-07 22:41:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 22:41:28,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2436 [2019-09-07 22:41:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:41:29,240 INFO L225 Difference]: With dead ends: 274712 [2019-09-07 22:41:29,240 INFO L226 Difference]: Without dead ends: 144799 [2019-09-07 22:41:29,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2453 GetRequests, 2444 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:41:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144799 states. [2019-09-07 22:41:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144799 to 138390. [2019-09-07 22:41:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138390 states. [2019-09-07 22:41:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138390 states to 138390 states and 143065 transitions. [2019-09-07 22:41:31,002 INFO L78 Accepts]: Start accepts. Automaton has 138390 states and 143065 transitions. Word has length 2436 [2019-09-07 22:41:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:41:31,005 INFO L475 AbstractCegarLoop]: Abstraction has 138390 states and 143065 transitions. [2019-09-07 22:41:31,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:41:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 138390 states and 143065 transitions. [2019-09-07 22:41:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2295 [2019-09-07 22:41:31,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:41:31,218 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:41:31,218 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:41:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:41:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1518318452, now seen corresponding path program 1 times [2019-09-07 22:41:31,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:41:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:41:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:41:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4757 backedges. 1245 proven. 235 refuted. 0 times theorem prover too weak. 3277 trivial. 0 not checked. [2019-09-07 22:41:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:41:34,813 INFO L223 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-09-07 22:41:34,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:41:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:41:35,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 2832 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:41:35,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:41:35,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:35,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:38,675 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 22:41:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:41:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4757 backedges. 3104 proven. 77 refuted. 0 times theorem prover too weak. 1576 trivial. 0 not checked. [2019-09-07 22:41:41,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:41:41,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 22:41:41,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:41:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:41:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2019-09-07 22:41:41,566 INFO L87 Difference]: Start difference. First operand 138390 states and 143065 transitions. Second operand 9 states. [2019-09-07 22:42:00,808 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-09-07 22:42:05,418 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 23 [2019-09-07 22:43:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:43:27,306 INFO L93 Difference]: Finished difference Result 281933 states and 291514 transitions. [2019-09-07 22:43:27,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 22:43:27,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2294 [2019-09-07 22:43:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:43:27,598 INFO L225 Difference]: With dead ends: 281933 [2019-09-07 22:43:27,598 INFO L226 Difference]: Without dead ends: 144259 [2019-09-07 22:43:27,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2318 GetRequests, 2298 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=90, Invalid=286, Unknown=4, NotChecked=0, Total=380 [2019-09-07 22:43:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144259 states. [2019-09-07 22:43:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144259 to 137085. [2019-09-07 22:43:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137085 states. [2019-09-07 22:43:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137085 states to 137085 states and 141040 transitions. [2019-09-07 22:43:29,561 INFO L78 Accepts]: Start accepts. Automaton has 137085 states and 141040 transitions. Word has length 2294 [2019-09-07 22:43:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:43:29,562 INFO L475 AbstractCegarLoop]: Abstraction has 137085 states and 141040 transitions. [2019-09-07 22:43:29,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:43:29,562 INFO L276 IsEmpty]: Start isEmpty. Operand 137085 states and 141040 transitions. [2019-09-07 22:43:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2379 [2019-09-07 22:43:29,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:43:29,733 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:43:29,733 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:43:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:43:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1203773422, now seen corresponding path program 1 times [2019-09-07 22:43:29,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:43:29,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:43:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:43:29,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:43:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5143 backedges. 1942 proven. 2 refuted. 0 times theorem prover too weak. 3199 trivial. 0 not checked. [2019-09-07 22:43:34,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:43:34,160 INFO L223 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-09-07 22:43:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:34,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 2911 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:43:34,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:43:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5143 backedges. 1942 proven. 2 refuted. 0 times theorem prover too weak. 3199 trivial. 0 not checked. [2019-09-07 22:43:39,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:43:39,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 22:43:39,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:43:39,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:43:39,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:43:39,672 INFO L87 Difference]: Start difference. First operand 137085 states and 141040 transitions. Second operand 7 states. [2019-09-07 22:43:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:43:47,340 INFO L93 Difference]: Finished difference Result 269211 states and 277099 transitions. [2019-09-07 22:43:47,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 22:43:47,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2378 [2019-09-07 22:43:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:43:47,651 INFO L225 Difference]: With dead ends: 269211 [2019-09-07 22:43:47,651 INFO L226 Difference]: Without dead ends: 136352 [2019-09-07 22:43:48,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2397 GetRequests, 2386 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-07 22:43:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136352 states. [2019-09-07 22:43:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136352 to 135595. [2019-09-07 22:43:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135595 states. [2019-09-07 22:43:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135595 states to 135595 states and 139015 transitions. [2019-09-07 22:43:49,743 INFO L78 Accepts]: Start accepts. Automaton has 135595 states and 139015 transitions. Word has length 2378 [2019-09-07 22:43:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:43:49,744 INFO L475 AbstractCegarLoop]: Abstraction has 135595 states and 139015 transitions. [2019-09-07 22:43:49,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:43:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 135595 states and 139015 transitions. [2019-09-07 22:43:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2527 [2019-09-07 22:43:49,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:43:49,971 INFO L399 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:43:49,971 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:43:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:43:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -536289746, now seen corresponding path program 1 times [2019-09-07 22:43:49,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:43:49,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:43:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:43:49,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:43:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 1526 proven. 572 refuted. 0 times theorem prover too weak. 2907 trivial. 0 not checked. [2019-09-07 22:43:54,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:43:54,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:43:54,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:43:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:43:55,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 3063 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 22:43:55,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:43:55,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:55,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:55,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:43:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5005 backedges. 3347 proven. 2 refuted. 0 times theorem prover too weak. 1656 trivial. 0 not checked. [2019-09-07 22:43:58,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:43:58,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 22:43:58,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:43:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:43:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:43:58,784 INFO L87 Difference]: Start difference. First operand 135595 states and 139015 transitions. Second operand 16 states. [2019-09-07 22:44:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:44:37,037 INFO L93 Difference]: Finished difference Result 276432 states and 283941 transitions. [2019-09-07 22:44:37,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 22:44:37,038 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 2526 [2019-09-07 22:44:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:44:37,326 INFO L225 Difference]: With dead ends: 276432 [2019-09-07 22:44:37,326 INFO L226 Difference]: Without dead ends: 146497 [2019-09-07 22:44:37,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2675 GetRequests, 2596 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1024, Invalid=5456, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 22:44:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146497 states. [2019-09-07 22:44:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146497 to 143472. [2019-09-07 22:44:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143472 states. [2019-09-07 22:44:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143472 states to 143472 states and 147028 transitions. [2019-09-07 22:44:39,315 INFO L78 Accepts]: Start accepts. Automaton has 143472 states and 147028 transitions. Word has length 2526 [2019-09-07 22:44:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:44:39,317 INFO L475 AbstractCegarLoop]: Abstraction has 143472 states and 147028 transitions. [2019-09-07 22:44:39,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:44:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 143472 states and 147028 transitions. [2019-09-07 22:44:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2577 [2019-09-07 22:44:39,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:44:39,504 INFO L399 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:44:39,505 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:44:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:44:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1153441197, now seen corresponding path program 1 times [2019-09-07 22:44:39,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:44:39,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:44:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:44:39,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:44:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:44:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:44:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5161 backedges. 1579 proven. 572 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2019-09-07 22:44:45,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:44:45,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:44:45,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:44:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:44:45,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 3137 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 22:44:45,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:44:45,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:45,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:45,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:45,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:45,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:44:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5161 backedges. 3447 proven. 2 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2019-09-07 22:44:51,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:44:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 22:44:51,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:44:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:44:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:44:51,604 INFO L87 Difference]: Start difference. First operand 143472 states and 147028 transitions. Second operand 16 states. [2019-09-07 22:45:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:45:30,796 INFO L93 Difference]: Finished difference Result 284176 states and 291381 transitions. [2019-09-07 22:45:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 22:45:30,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 2576 [2019-09-07 22:45:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:45:31,091 INFO L225 Difference]: With dead ends: 284176 [2019-09-07 22:45:31,091 INFO L226 Difference]: Without dead ends: 147066 [2019-09-07 22:45:31,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2706 GetRequests, 2636 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=736, Invalid=4376, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 22:45:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147066 states. [2019-09-07 22:45:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147066 to 143420. [2019-09-07 22:45:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143420 states. [2019-09-07 22:45:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143420 states to 143420 states and 146817 transitions. [2019-09-07 22:45:33,094 INFO L78 Accepts]: Start accepts. Automaton has 143420 states and 146817 transitions. Word has length 2576 [2019-09-07 22:45:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:45:33,096 INFO L475 AbstractCegarLoop]: Abstraction has 143420 states and 146817 transitions. [2019-09-07 22:45:33,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:45:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 143420 states and 146817 transitions. [2019-09-07 22:45:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2604 [2019-09-07 22:45:33,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:45:33,302 INFO L399 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:45:33,302 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:45:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:45:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1388122276, now seen corresponding path program 1 times [2019-09-07 22:45:33,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:45:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:45:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:45:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:45:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:45:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:45:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4918 backedges. 1570 proven. 578 refuted. 0 times theorem prover too weak. 2770 trivial. 0 not checked. [2019-09-07 22:45:40,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:45:40,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:45:40,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:45:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:45:41,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 3121 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:45:41,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:45:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:45:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4918 backedges. 3120 proven. 2 refuted. 0 times theorem prover too weak. 1796 trivial. 0 not checked. [2019-09-07 22:45:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:45:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:45:43,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:45:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:45:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:45:43,372 INFO L87 Difference]: Start difference. First operand 143420 states and 146817 transitions. Second operand 15 states. [2019-09-07 22:46:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:46:16,576 INFO L93 Difference]: Finished difference Result 284212 states and 294671 transitions. [2019-09-07 22:46:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 22:46:16,580 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2603 [2019-09-07 22:46:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:46:16,995 INFO L225 Difference]: With dead ends: 284212 [2019-09-07 22:46:16,995 INFO L226 Difference]: Without dead ends: 147154 [2019-09-07 22:46:17,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2729 GetRequests, 2660 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=682, Invalid=4288, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 22:46:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147154 states. [2019-09-07 22:46:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147154 to 142625. [2019-09-07 22:46:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142625 states. [2019-09-07 22:46:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142625 states to 142625 states and 145907 transitions. [2019-09-07 22:46:19,222 INFO L78 Accepts]: Start accepts. Automaton has 142625 states and 145907 transitions. Word has length 2603 [2019-09-07 22:46:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:46:19,223 INFO L475 AbstractCegarLoop]: Abstraction has 142625 states and 145907 transitions. [2019-09-07 22:46:19,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:46:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 142625 states and 145907 transitions. [2019-09-07 22:46:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2801 [2019-09-07 22:46:19,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:46:19,423 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 22:46:19,423 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:46:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:46:19,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1457187058, now seen corresponding path program 1 times [2019-09-07 22:46:19,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:46:19,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:46:19,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:46:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:46:19,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:46:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:46:35,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6510 backedges. 1171 proven. 3617 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2019-09-07 22:46:35,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:46:35,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:46:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:46:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:46:35,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 3380 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:46:35,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:46:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:46:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:46:36,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:48:00,021 WARN L188 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 958 DAG size of output: 68 [2019-09-07 22:48:00,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:48:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6510 backedges. 4528 proven. 100 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2019-09-07 22:48:02,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:48:02,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 8] total 31 [2019-09-07 22:48:02,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 22:48:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 22:48:02,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=827, Unknown=3, NotChecked=0, Total=930 [2019-09-07 22:48:02,934 INFO L87 Difference]: Start difference. First operand 142625 states and 145907 transitions. Second operand 31 states. [2019-09-07 22:48:16,308 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2019-09-07 22:48:18,749 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47