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/Problem16_label05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:57:01,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:57:01,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:57:01,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:57:01,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:57:01,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:57:01,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:57:01,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:57:01,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:57:01,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:57:01,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:57:01,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:57:01,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:57:01,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:57:01,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:57:01,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:57:01,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:57:01,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:57:01,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:57:01,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:57:01,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:57:01,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:57:01,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:57:01,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:57:01,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:57:01,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:57:01,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:57:01,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:57:01,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:57:01,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:57:01,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:57:01,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:57:01,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:57:01,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:57:01,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:57:01,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:57:01,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:57:01,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:57:01,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:57:01,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:57:01,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:57:01,650 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 20:57:01,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:57:01,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:57:01,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:57:01,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:57:01,666 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:57:01,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:57:01,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:57:01,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:57:01,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:57:01,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:57:01,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:57:01,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:57:01,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:57:01,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:57:01,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:57:01,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:57:01,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:57:01,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:57:01,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:57:01,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:57:01,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:57:01,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:57:01,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:57:01,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:57:01,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:57:01,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:57:01,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:57:01,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:57:01,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:57:01,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:57:01,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:57:01,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:57:01,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:57:01,717 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:57:01,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label05.c [2019-09-07 20:57:01,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adaf70758/9df2b66191f94218a3f74ff3dd4dae1d/FLAG6a8e93831 [2019-09-07 20:57:02,505 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:57:02,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label05.c [2019-09-07 20:57:02,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adaf70758/9df2b66191f94218a3f74ff3dd4dae1d/FLAG6a8e93831 [2019-09-07 20:57:02,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adaf70758/9df2b66191f94218a3f74ff3dd4dae1d [2019-09-07 20:57:02,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:57:02,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:57:02,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:57:02,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:57:02,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:57:02,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:57:02" (1/1) ... [2019-09-07 20:57:02,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4db4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:02, skipping insertion in model container [2019-09-07 20:57:02,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:57:02" (1/1) ... [2019-09-07 20:57:02,669 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:57:02,752 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:57:03,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:57:03,611 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:57:03,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:57:03,846 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:57:03,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03 WrapperNode [2019-09-07 20:57:03,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:57:03,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:57:03,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:57:03,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:57:03,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:03,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:03,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:03,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:04,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:04,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:04,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... [2019-09-07 20:57:04,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:57:04,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:57:04,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:57:04,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:57:04,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:57:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:57:04,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:57:04,141 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:57:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:57:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:57:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:57:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:57:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:57:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:57:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:57:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:57:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:57:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:57:06,639 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:57:06,639 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:57:06,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:57:06 BoogieIcfgContainer [2019-09-07 20:57:06,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:57:06,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:57:06,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:57:06,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:57:06,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:57:02" (1/3) ... [2019-09-07 20:57:06,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ae004f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:57:06, skipping insertion in model container [2019-09-07 20:57:06,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:57:03" (2/3) ... [2019-09-07 20:57:06,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ae004f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:57:06, skipping insertion in model container [2019-09-07 20:57:06,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:57:06" (3/3) ... [2019-09-07 20:57:06,660 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label05.c [2019-09-07 20:57:06,674 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:57:06,685 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:57:06,702 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:57:06,749 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:57:06,749 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:57:06,750 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:57:06,750 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:57:06,750 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:57:06,750 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:57:06,750 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:57:06,750 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:57:06,750 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:57:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-07 20:57:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 20:57:06,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:06,786 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] [2019-09-07 20:57:06,788 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 521251962, now seen corresponding path program 1 times [2019-09-07 20:57:06,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:07,052 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 20:57:07,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:57:07,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:57:07,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:57:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:57:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:57:07,077 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 3 states. [2019-09-07 20:57:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:09,634 INFO L93 Difference]: Finished difference Result 1153 states and 2141 transitions. [2019-09-07 20:57:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:57:09,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 20:57:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:09,657 INFO L225 Difference]: With dead ends: 1153 [2019-09-07 20:57:09,658 INFO L226 Difference]: Without dead ends: 682 [2019-09-07 20:57:09,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:57:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-07 20:57:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-09-07 20:57:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-09-07 20:57:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1154 transitions. [2019-09-07 20:57:09,771 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1154 transitions. Word has length 25 [2019-09-07 20:57:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:09,771 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1154 transitions. [2019-09-07 20:57:09,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:57:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1154 transitions. [2019-09-07 20:57:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 20:57:09,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:09,777 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 20:57:09,777 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1195239347, now seen corresponding path program 1 times [2019-09-07 20:57:09,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:09,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:57:10,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:57:10,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:57:10,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:57:10,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:57:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:57:10,058 INFO L87 Difference]: Start difference. First operand 682 states and 1154 transitions. Second operand 6 states. [2019-09-07 20:57:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:15,174 INFO L93 Difference]: Finished difference Result 2806 states and 4911 transitions. [2019-09-07 20:57:15,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:57:15,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-07 20:57:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:15,197 INFO L225 Difference]: With dead ends: 2806 [2019-09-07 20:57:15,197 INFO L226 Difference]: Without dead ends: 2130 [2019-09-07 20:57:15,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:57:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-09-07 20:57:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2087. [2019-09-07 20:57:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-09-07 20:57:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 3381 transitions. [2019-09-07 20:57:15,322 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 3381 transitions. Word has length 100 [2019-09-07 20:57:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:15,323 INFO L475 AbstractCegarLoop]: Abstraction has 2087 states and 3381 transitions. [2019-09-07 20:57:15,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:57:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3381 transitions. [2019-09-07 20:57:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 20:57:15,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:15,339 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:15,340 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash 876935586, now seen corresponding path program 1 times [2019-09-07 20:57:15,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:15,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:15,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 36 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:57:15,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:15,626 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) [2019-09-07 20:57:15,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:57:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:15,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:57:15,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 20:57:15,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:57:15,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:57:15,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:15,896 INFO L87 Difference]: Start difference. First operand 2087 states and 3381 transitions. Second operand 9 states. [2019-09-07 20:57:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:20,584 INFO L93 Difference]: Finished difference Result 7117 states and 12239 transitions. [2019-09-07 20:57:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:57:20,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2019-09-07 20:57:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:20,623 INFO L225 Difference]: With dead ends: 7117 [2019-09-07 20:57:20,623 INFO L226 Difference]: Without dead ends: 5036 [2019-09-07 20:57:20,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:57:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-09-07 20:57:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4972. [2019-09-07 20:57:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4972 states. [2019-09-07 20:57:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 7764 transitions. [2019-09-07 20:57:20,790 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 7764 transitions. Word has length 187 [2019-09-07 20:57:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:20,791 INFO L475 AbstractCegarLoop]: Abstraction has 4972 states and 7764 transitions. [2019-09-07 20:57:20,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 7764 transitions. [2019-09-07 20:57:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-07 20:57:20,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:20,794 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:20,795 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -976233538, now seen corresponding path program 1 times [2019-09-07 20:57:20,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:20,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:20,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:20,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:20,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:57:21,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:21,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 20:57:21,061 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 20:57:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:21,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:57:21,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 20:57:21,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:57:21,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:57:21,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:21,237 INFO L87 Difference]: Start difference. First operand 4972 states and 7764 transitions. Second operand 9 states. [2019-09-07 20:57:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:25,548 INFO L93 Difference]: Finished difference Result 13161 states and 21183 transitions. [2019-09-07 20:57:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:57:25,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-09-07 20:57:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:25,605 INFO L225 Difference]: With dead ends: 13161 [2019-09-07 20:57:25,605 INFO L226 Difference]: Without dead ends: 8195 [2019-09-07 20:57:25,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:57:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2019-09-07 20:57:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 8139. [2019-09-07 20:57:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8139 states. [2019-09-07 20:57:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8139 states to 8139 states and 11862 transitions. [2019-09-07 20:57:25,870 INFO L78 Accepts]: Start accepts. Automaton has 8139 states and 11862 transitions. Word has length 189 [2019-09-07 20:57:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:25,871 INFO L475 AbstractCegarLoop]: Abstraction has 8139 states and 11862 transitions. [2019-09-07 20:57:25,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8139 states and 11862 transitions. [2019-09-07 20:57:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 20:57:25,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:25,874 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:25,874 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:25,875 INFO L82 PathProgramCache]: Analyzing trace with hash 430030410, now seen corresponding path program 1 times [2019-09-07 20:57:25,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:25,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:25,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 20:57:26,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:26,112 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 20:57:26,139 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 20:57:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:26,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:57:26,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 117 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:57:26,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:57:26,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:57:26,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:26,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:26,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:26,317 INFO L87 Difference]: Start difference. First operand 8139 states and 11862 transitions. Second operand 9 states. [2019-09-07 20:57:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:29,855 INFO L93 Difference]: Finished difference Result 20707 states and 30855 transitions. [2019-09-07 20:57:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:57:29,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-09-07 20:57:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:29,933 INFO L225 Difference]: With dead ends: 20707 [2019-09-07 20:57:29,933 INFO L226 Difference]: Without dead ends: 12574 [2019-09-07 20:57:29,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:57:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12574 states. [2019-09-07 20:57:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12574 to 9820. [2019-09-07 20:57:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9820 states. [2019-09-07 20:57:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9820 states to 9820 states and 13965 transitions. [2019-09-07 20:57:30,221 INFO L78 Accepts]: Start accepts. Automaton has 9820 states and 13965 transitions. Word has length 199 [2019-09-07 20:57:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:30,223 INFO L475 AbstractCegarLoop]: Abstraction has 9820 states and 13965 transitions. [2019-09-07 20:57:30,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9820 states and 13965 transitions. [2019-09-07 20:57:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-07 20:57:30,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:30,233 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:30,233 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1855451189, now seen corresponding path program 1 times [2019-09-07 20:57:30,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:30,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:30,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:30,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:30,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 54 proven. 190 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:57:30,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:30,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:57:30,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:30,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:57:30,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 20:57:30,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:57:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:57:30,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:30,911 INFO L87 Difference]: Start difference. First operand 9820 states and 13965 transitions. Second operand 9 states. [2019-09-07 20:57:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:34,814 INFO L93 Difference]: Finished difference Result 21769 states and 31265 transitions. [2019-09-07 20:57:34,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:57:34,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 358 [2019-09-07 20:57:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:34,884 INFO L225 Difference]: With dead ends: 21769 [2019-09-07 20:57:34,890 INFO L226 Difference]: Without dead ends: 11955 [2019-09-07 20:57:34,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:57:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2019-09-07 20:57:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 9837. [2019-09-07 20:57:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9837 states. [2019-09-07 20:57:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9837 states to 9837 states and 12910 transitions. [2019-09-07 20:57:35,196 INFO L78 Accepts]: Start accepts. Automaton has 9837 states and 12910 transitions. Word has length 358 [2019-09-07 20:57:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:35,197 INFO L475 AbstractCegarLoop]: Abstraction has 9837 states and 12910 transitions. [2019-09-07 20:57:35,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9837 states and 12910 transitions. [2019-09-07 20:57:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-07 20:57:35,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:35,212 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:57:35,212 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1078655473, now seen corresponding path program 1 times [2019-09-07 20:57:35,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:35,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:35,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:35,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:35,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 171 proven. 83 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-07 20:57:35,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:35,690 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 20:57:35,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:35,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:57:35,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 20:57:36,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:57:36,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:57:36,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:36,005 INFO L87 Difference]: Start difference. First operand 9837 states and 12910 transitions. Second operand 9 states. [2019-09-07 20:57:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:42,278 INFO L93 Difference]: Finished difference Result 24310 states and 33863 transitions. [2019-09-07 20:57:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:57:42,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 472 [2019-09-07 20:57:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:42,340 INFO L225 Difference]: With dead ends: 24310 [2019-09-07 20:57:42,341 INFO L226 Difference]: Without dead ends: 14479 [2019-09-07 20:57:42,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:57:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2019-09-07 20:57:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 14449. [2019-09-07 20:57:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14449 states. [2019-09-07 20:57:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14449 states to 14449 states and 18762 transitions. [2019-09-07 20:57:42,701 INFO L78 Accepts]: Start accepts. Automaton has 14449 states and 18762 transitions. Word has length 472 [2019-09-07 20:57:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:42,702 INFO L475 AbstractCegarLoop]: Abstraction has 14449 states and 18762 transitions. [2019-09-07 20:57:42,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 14449 states and 18762 transitions. [2019-09-07 20:57:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-09-07 20:57:42,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:42,729 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:57:42,729 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 607768562, now seen corresponding path program 1 times [2019-09-07 20:57:42,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:42,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:42,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:42,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:42,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 53 proven. 321 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 20:57:43,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:43,692 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 20:57:43,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:43,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:57:43,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:57:44,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:57:44,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 20:57:44,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:44,098 INFO L87 Difference]: Start difference. First operand 14449 states and 18762 transitions. Second operand 9 states. [2019-09-07 20:57:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:48,175 INFO L93 Difference]: Finished difference Result 32992 states and 42524 transitions. [2019-09-07 20:57:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:57:48,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 605 [2019-09-07 20:57:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:48,236 INFO L225 Difference]: With dead ends: 32992 [2019-09-07 20:57:48,237 INFO L226 Difference]: Without dead ends: 18549 [2019-09-07 20:57:48,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:57:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18549 states. [2019-09-07 20:57:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18549 to 15476. [2019-09-07 20:57:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2019-09-07 20:57:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 19252 transitions. [2019-09-07 20:57:48,585 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 19252 transitions. Word has length 605 [2019-09-07 20:57:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:48,587 INFO L475 AbstractCegarLoop]: Abstraction has 15476 states and 19252 transitions. [2019-09-07 20:57:48,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 19252 transitions. [2019-09-07 20:57:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2019-09-07 20:57:48,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:48,652 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:57:48,652 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1071806582, now seen corresponding path program 1 times [2019-09-07 20:57:48,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:48,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:48,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:48,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1043 trivial. 0 not checked. [2019-09-07 20:57:49,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:57:49,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:57:49,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:57:49,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:57:49,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:57:49,472 INFO L87 Difference]: Start difference. First operand 15476 states and 19252 transitions. Second operand 3 states. [2019-09-07 20:57:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:51,587 INFO L93 Difference]: Finished difference Result 35722 states and 44725 transitions. [2019-09-07 20:57:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:57:51,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 833 [2019-09-07 20:57:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:51,650 INFO L225 Difference]: With dead ends: 35722 [2019-09-07 20:57:51,650 INFO L226 Difference]: Without dead ends: 20252 [2019-09-07 20:57:51,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:57:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20252 states. [2019-09-07 20:57:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20252 to 18888. [2019-09-07 20:57:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18888 states. [2019-09-07 20:57:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18888 states to 18888 states and 23277 transitions. [2019-09-07 20:57:52,092 INFO L78 Accepts]: Start accepts. Automaton has 18888 states and 23277 transitions. Word has length 833 [2019-09-07 20:57:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:52,094 INFO L475 AbstractCegarLoop]: Abstraction has 18888 states and 23277 transitions. [2019-09-07 20:57:52,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:57:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18888 states and 23277 transitions. [2019-09-07 20:57:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2019-09-07 20:57:52,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:52,180 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:52,180 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1112359770, now seen corresponding path program 1 times [2019-09-07 20:57:52,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:52,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:52,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:52,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 291 proven. 228 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2019-09-07 20:57:53,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:57:53,308 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 20:57:53,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:57:53,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:57:53,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:57:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 1103 proven. 2 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 20:57:54,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:57:54,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:57:54,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:57:54,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:57:54,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:57:54,099 INFO L87 Difference]: Start difference. First operand 18888 states and 23277 transitions. Second operand 9 states. [2019-09-07 20:57:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:57:59,082 INFO L93 Difference]: Finished difference Result 39566 states and 48262 transitions. [2019-09-07 20:57:59,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:57:59,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1031 [2019-09-07 20:57:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:57:59,146 INFO L225 Difference]: With dead ends: 39566 [2019-09-07 20:57:59,146 INFO L226 Difference]: Without dead ends: 20684 [2019-09-07 20:57:59,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1048 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:57:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20684 states. [2019-09-07 20:57:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20684 to 19292. [2019-09-07 20:57:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19292 states. [2019-09-07 20:57:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19292 states to 19292 states and 22291 transitions. [2019-09-07 20:57:59,463 INFO L78 Accepts]: Start accepts. Automaton has 19292 states and 22291 transitions. Word has length 1031 [2019-09-07 20:57:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:57:59,464 INFO L475 AbstractCegarLoop]: Abstraction has 19292 states and 22291 transitions. [2019-09-07 20:57:59,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:57:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19292 states and 22291 transitions. [2019-09-07 20:57:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1087 [2019-09-07 20:57:59,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:57:59,542 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:57:59,542 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:57:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:57:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash 142771531, now seen corresponding path program 1 times [2019-09-07 20:57:59,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:57:59,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:57:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:57:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:57:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:02,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 594 proven. 250 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2019-09-07 20:58:02,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:02,798 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 20:58:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:03,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:58:03,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 835 proven. 2 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-09-07 20:58:04,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:58:04,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 20:58:04,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:58:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:58:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:58:04,648 INFO L87 Difference]: Start difference. First operand 19292 states and 22291 transitions. Second operand 13 states. [2019-09-07 20:58:05,269 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-07 20:58:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:14,341 INFO L93 Difference]: Finished difference Result 39359 states and 47100 transitions. [2019-09-07 20:58:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:58:14,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1086 [2019-09-07 20:58:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:14,406 INFO L225 Difference]: With dead ends: 39359 [2019-09-07 20:58:14,406 INFO L226 Difference]: Without dead ends: 20073 [2019-09-07 20:58:14,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1158 GetRequests, 1110 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=491, Invalid=1959, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 20:58:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2019-09-07 20:58:14,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 19368. [2019-09-07 20:58:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19368 states. [2019-09-07 20:58:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19368 states to 19368 states and 21481 transitions. [2019-09-07 20:58:14,777 INFO L78 Accepts]: Start accepts. Automaton has 19368 states and 21481 transitions. Word has length 1086 [2019-09-07 20:58:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:14,778 INFO L475 AbstractCegarLoop]: Abstraction has 19368 states and 21481 transitions. [2019-09-07 20:58:14,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:58:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19368 states and 21481 transitions. [2019-09-07 20:58:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2019-09-07 20:58:14,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:14,825 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 20:58:14,825 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:14,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:14,826 INFO L82 PathProgramCache]: Analyzing trace with hash 421836078, now seen corresponding path program 1 times [2019-09-07 20:58:14,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:14,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:14,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:14,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 711 proven. 410 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-09-07 20:58:16,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:16,141 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 20:58:16,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:16,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:58:16,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1759 backedges. 1383 proven. 2 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2019-09-07 20:58:17,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:58:17,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:58:17,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:58:17,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:58:17,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:58:17,009 INFO L87 Difference]: Start difference. First operand 19368 states and 21481 transitions. Second operand 9 states. [2019-09-07 20:58:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:21,681 INFO L93 Difference]: Finished difference Result 43207 states and 48045 transitions. [2019-09-07 20:58:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:58:21,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1129 [2019-09-07 20:58:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:21,709 INFO L225 Difference]: With dead ends: 43207 [2019-09-07 20:58:21,709 INFO L226 Difference]: Without dead ends: 21253 [2019-09-07 20:58:21,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 1134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:58:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21253 states. [2019-09-07 20:58:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21253 to 18132. [2019-09-07 20:58:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18132 states. [2019-09-07 20:58:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18132 states to 18132 states and 18883 transitions. [2019-09-07 20:58:21,950 INFO L78 Accepts]: Start accepts. Automaton has 18132 states and 18883 transitions. Word has length 1129 [2019-09-07 20:58:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:21,951 INFO L475 AbstractCegarLoop]: Abstraction has 18132 states and 18883 transitions. [2019-09-07 20:58:21,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:58:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 18132 states and 18883 transitions. [2019-09-07 20:58:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1391 [2019-09-07 20:58:21,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:21,983 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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] [2019-09-07 20:58:21,984 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1974144067, now seen corresponding path program 1 times [2019-09-07 20:58:21,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:21,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:21,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 577 proven. 594 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-07 20:58:26,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:26,669 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 20:58:26,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:26,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:58:26,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2771 backedges. 1026 proven. 0 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2019-09-07 20:58:27,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:58:27,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-07 20:58:27,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:58:27,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:58:27,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:58:27,753 INFO L87 Difference]: Start difference. First operand 18132 states and 18883 transitions. Second operand 14 states. [2019-09-07 20:58:30,831 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-07 20:58:31,204 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-07 20:58:31,634 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 20:58:33,591 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-07 20:58:34,355 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-07 20:58:35,681 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 20:58:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:35,891 INFO L93 Difference]: Finished difference Result 35959 states and 37513 transitions. [2019-09-07 20:58:35,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 20:58:35,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1390 [2019-09-07 20:58:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:35,918 INFO L225 Difference]: With dead ends: 35959 [2019-09-07 20:58:35,919 INFO L226 Difference]: Without dead ends: 18509 [2019-09-07 20:58:35,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1458 GetRequests, 1413 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=489, Invalid=1581, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 20:58:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18509 states. [2019-09-07 20:58:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18509 to 18132. [2019-09-07 20:58:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18132 states. [2019-09-07 20:58:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18132 states to 18132 states and 18872 transitions. [2019-09-07 20:58:36,161 INFO L78 Accepts]: Start accepts. Automaton has 18132 states and 18872 transitions. Word has length 1390 [2019-09-07 20:58:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:36,161 INFO L475 AbstractCegarLoop]: Abstraction has 18132 states and 18872 transitions. [2019-09-07 20:58:36,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:58:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 18132 states and 18872 transitions. [2019-09-07 20:58:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1721 [2019-09-07 20:58:36,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:36,203 INFO L399 BasicCegarLoop]: trace histogram [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, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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 20:58:36,203 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1624043099, now seen corresponding path program 1 times [2019-09-07 20:58:36,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:36,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:36,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5569 backedges. 2784 proven. 771 refuted. 0 times theorem prover too weak. 2014 trivial. 0 not checked. [2019-09-07 20:58:40,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:40,197 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 20:58:40,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:40,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:58:40,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5569 backedges. 1617 proven. 2 refuted. 0 times theorem prover too weak. 3950 trivial. 0 not checked. [2019-09-07 20:58:41,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:58:41,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 20:58:41,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:58:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:58:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:58:41,827 INFO L87 Difference]: Start difference. First operand 18132 states and 18872 transitions. Second operand 18 states. [2019-09-07 20:58:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:50,541 INFO L93 Difference]: Finished difference Result 37656 states and 39253 transitions. [2019-09-07 20:58:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 20:58:50,542 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1720 [2019-09-07 20:58:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:50,581 INFO L225 Difference]: With dead ends: 37656 [2019-09-07 20:58:50,582 INFO L226 Difference]: Without dead ends: 20206 [2019-09-07 20:58:50,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1799 GetRequests, 1750 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=557, Invalid=1993, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 20:58:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20206 states. [2019-09-07 20:58:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20206 to 19163. [2019-09-07 20:58:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19163 states. [2019-09-07 20:58:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19163 states to 19163 states and 19746 transitions. [2019-09-07 20:58:50,810 INFO L78 Accepts]: Start accepts. Automaton has 19163 states and 19746 transitions. Word has length 1720 [2019-09-07 20:58:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:50,812 INFO L475 AbstractCegarLoop]: Abstraction has 19163 states and 19746 transitions. [2019-09-07 20:58:50,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:58:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19163 states and 19746 transitions. [2019-09-07 20:58:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1803 [2019-09-07 20:58:50,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:50,842 INFO L399 BasicCegarLoop]: trace histogram [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, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:58:50,842 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash 724751719, now seen corresponding path program 1 times [2019-09-07 20:58:50,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5615 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 5429 trivial. 0 not checked. [2019-09-07 20:58:53,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:58:53,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:58:53,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:58:53,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:58:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:58:53,170 INFO L87 Difference]: Start difference. First operand 19163 states and 19746 transitions. Second operand 3 states. [2019-09-07 20:58:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:58:54,495 INFO L93 Difference]: Finished difference Result 42375 states and 43708 transitions. [2019-09-07 20:58:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:58:54,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1802 [2019-09-07 20:58:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:58:54,524 INFO L225 Difference]: With dead ends: 42375 [2019-09-07 20:58:54,525 INFO L226 Difference]: Without dead ends: 23554 [2019-09-07 20:58:54,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:58:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23554 states. [2019-09-07 20:58:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23554 to 20854. [2019-09-07 20:58:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20854 states. [2019-09-07 20:58:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20854 states to 20854 states and 21500 transitions. [2019-09-07 20:58:54,751 INFO L78 Accepts]: Start accepts. Automaton has 20854 states and 21500 transitions. Word has length 1802 [2019-09-07 20:58:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:58:54,752 INFO L475 AbstractCegarLoop]: Abstraction has 20854 states and 21500 transitions. [2019-09-07 20:58:54,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:58:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20854 states and 21500 transitions. [2019-09-07 20:58:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2142 [2019-09-07 20:58:54,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:58:54,790 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-07 20:58:54,790 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:58:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:58:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1320563141, now seen corresponding path program 1 times [2019-09-07 20:58:54,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:58:54,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:58:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:54,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:58:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7802 backedges. 238 proven. 3745 refuted. 0 times theorem prover too weak. 3819 trivial. 0 not checked. [2019-09-07 20:58:57,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:58:57,835 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 20:58:57,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:58:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:58:58,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 2663 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 20:58:58,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:58:58,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:59:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7802 backedges. 3312 proven. 5 refuted. 0 times theorem prover too weak. 4485 trivial. 0 not checked. [2019-09-07 20:59:00,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:59:00,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-07 20:59:00,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:59:00,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:59:00,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:59:00,939 INFO L87 Difference]: Start difference. First operand 20854 states and 21500 transitions. Second operand 14 states. [2019-09-07 20:59:08,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:59:08,669 INFO L93 Difference]: Finished difference Result 49309 states and 50784 transitions. [2019-09-07 20:59:08,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 20:59:08,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 2141 [2019-09-07 20:59:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:59:08,707 INFO L225 Difference]: With dead ends: 49309 [2019-09-07 20:59:08,707 INFO L226 Difference]: Without dead ends: 28800 [2019-09-07 20:59:08,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2213 GetRequests, 2170 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 20:59:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28800 states. [2019-09-07 20:59:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28800 to 26411. [2019-09-07 20:59:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26411 states. [2019-09-07 20:59:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26411 states to 26411 states and 27144 transitions. [2019-09-07 20:59:09,076 INFO L78 Accepts]: Start accepts. Automaton has 26411 states and 27144 transitions. Word has length 2141 [2019-09-07 20:59:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:59:09,076 INFO L475 AbstractCegarLoop]: Abstraction has 26411 states and 27144 transitions. [2019-09-07 20:59:09,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:59:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 26411 states and 27144 transitions. [2019-09-07 20:59:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2176 [2019-09-07 20:59:09,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:59:09,128 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:09,128 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:59:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:59:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1016566307, now seen corresponding path program 1 times [2019-09-07 20:59:09,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:59:09,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:59:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:09,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:09,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8586 backedges. 2445 proven. 2117 refuted. 0 times theorem prover too weak. 4024 trivial. 0 not checked. [2019-09-07 20:59:15,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:59:15,281 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 20:59:15,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:15,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 2736 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 20:59:15,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:59:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:59:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8586 backedges. 3113 proven. 2 refuted. 0 times theorem prover too weak. 5471 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:59:17,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:59:17,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-09-07 20:59:17,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:59:17,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:59:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:59:17,853 INFO L87 Difference]: Start difference. First operand 26411 states and 27144 transitions. Second operand 20 states. [2019-09-07 20:59:21,007 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 20:59:22,191 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-09-07 20:59:25,325 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 20:59:28,675 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 20:59:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:59:29,090 INFO L93 Difference]: Finished difference Result 50589 states and 52252 transitions. [2019-09-07 20:59:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 20:59:29,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 2175 [2019-09-07 20:59:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:59:29,131 INFO L225 Difference]: With dead ends: 50589 [2019-09-07 20:59:29,132 INFO L226 Difference]: Without dead ends: 26560 [2019-09-07 20:59:29,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2273 GetRequests, 2209 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=766, Invalid=3266, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 20:59:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26560 states. [2019-09-07 20:59:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26560 to 26392. [2019-09-07 20:59:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26392 states. [2019-09-07 20:59:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26392 states to 26392 states and 27099 transitions. [2019-09-07 20:59:29,518 INFO L78 Accepts]: Start accepts. Automaton has 26392 states and 27099 transitions. Word has length 2175 [2019-09-07 20:59:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:59:29,519 INFO L475 AbstractCegarLoop]: Abstraction has 26392 states and 27099 transitions. [2019-09-07 20:59:29,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:59:29,520 INFO L276 IsEmpty]: Start isEmpty. Operand 26392 states and 27099 transitions. [2019-09-07 20:59:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2263 [2019-09-07 20:59:29,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:59:29,625 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:59:29,626 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:59:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:59:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash -527090125, now seen corresponding path program 1 times [2019-09-07 20:59:29,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:59:29,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:59:29,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:29,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9886 backedges. 2208 proven. 2 refuted. 0 times theorem prover too weak. 7676 trivial. 0 not checked. [2019-09-07 20:59:32,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:59:32,751 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) [2019-09-07 20:59:32,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:59:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:33,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 2840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:59:33,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:59:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 9886 backedges. 2208 proven. 2 refuted. 0 times theorem prover too weak. 7676 trivial. 0 not checked. [2019-09-07 20:59:35,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:59:35,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 20:59:35,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:59:35,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:59:35,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:59:35,092 INFO L87 Difference]: Start difference. First operand 26392 states and 27099 transitions. Second operand 6 states. [2019-09-07 20:59:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:59:38,273 INFO L93 Difference]: Finished difference Result 52439 states and 53891 transitions. [2019-09-07 20:59:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:59:38,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2262 [2019-09-07 20:59:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:59:38,316 INFO L225 Difference]: With dead ends: 52439 [2019-09-07 20:59:38,316 INFO L226 Difference]: Without dead ends: 28429 [2019-09-07 20:59:38,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2274 GetRequests, 2266 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:59:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28429 states. [2019-09-07 20:59:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28429 to 28423. [2019-09-07 20:59:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28423 states. [2019-09-07 20:59:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28423 states to 28423 states and 29169 transitions. [2019-09-07 20:59:38,704 INFO L78 Accepts]: Start accepts. Automaton has 28423 states and 29169 transitions. Word has length 2262 [2019-09-07 20:59:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:59:38,705 INFO L475 AbstractCegarLoop]: Abstraction has 28423 states and 29169 transitions. [2019-09-07 20:59:38,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:59:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28423 states and 29169 transitions. [2019-09-07 20:59:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2365 [2019-09-07 20:59:38,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:59:38,759 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:59:38,759 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:59:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:59:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash -427814053, now seen corresponding path program 1 times [2019-09-07 20:59:38,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:59:38,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:59:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:59:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10864 backedges. 2514 proven. 2217 refuted. 0 times theorem prover too weak. 6133 trivial. 0 not checked. [2019-09-07 20:59:48,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:59:48,462 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 20:59:48,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:59:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:59:48,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 2945 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 20:59:49,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:59:49,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:59:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10864 backedges. 7165 proven. 6 refuted. 0 times theorem prover too weak. 3693 trivial. 0 not checked. [2019-09-07 20:59:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:59:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-09-07 20:59:51,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 20:59:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 20:59:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-07 20:59:51,066 INFO L87 Difference]: Start difference. First operand 28423 states and 29169 transitions. Second operand 26 states. [2019-09-07 20:59:53,662 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-07 20:59:56,716 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 20:59:58,051 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-07 20:59:59,936 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-07 21:00:01,282 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 21:00:01,484 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-07 21:00:02,082 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-07 21:00:10,478 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-07 21:00:12,925 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-07 21:00:13,645 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-07 21:00:13,997 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-07 21:00:14,659 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2019-09-07 21:00:14,924 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-09-07 21:00:16,642 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-07 21:00:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:18,446 INFO L93 Difference]: Finished difference Result 55187 states and 56668 transitions. [2019-09-07 21:00:18,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 21:00:18,447 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 2364 [2019-09-07 21:00:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:18,487 INFO L225 Difference]: With dead ends: 55187 [2019-09-07 21:00:18,487 INFO L226 Difference]: Without dead ends: 29148 [2019-09-07 21:00:18,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2522 GetRequests, 2420 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1538, Invalid=8562, Unknown=0, NotChecked=0, Total=10100 [2019-09-07 21:00:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29148 states. [2019-09-07 21:00:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29148 to 28773. [2019-09-07 21:00:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28773 states. [2019-09-07 21:00:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28773 states to 28773 states and 29522 transitions. [2019-09-07 21:00:18,855 INFO L78 Accepts]: Start accepts. Automaton has 28773 states and 29522 transitions. Word has length 2364 [2019-09-07 21:00:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:18,857 INFO L475 AbstractCegarLoop]: Abstraction has 28773 states and 29522 transitions. [2019-09-07 21:00:18,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 21:00:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 28773 states and 29522 transitions. [2019-09-07 21:00:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2410 [2019-09-07 21:00:18,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:18,945 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:00:18,945 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1714974794, now seen corresponding path program 1 times [2019-09-07 21:00:18,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:18,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:18,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:18,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10853 backedges. 2164 proven. 2113 refuted. 0 times theorem prover too weak. 6576 trivial. 0 not checked. [2019-09-07 21:00:27,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:00:27,437 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 21:00:27,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:00:27,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 2983 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:00:27,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:00:28,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:28,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:28,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:28,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:28,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:28,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:28,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:00:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10853 backedges. 4039 proven. 2 refuted. 0 times theorem prover too weak. 6812 trivial. 0 not checked. [2019-09-07 21:00:30,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:00:30,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 21:00:30,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 21:00:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 21:00:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-09-07 21:00:30,230 INFO L87 Difference]: Start difference. First operand 28773 states and 29522 transitions. Second operand 17 states. [2019-09-07 21:00:51,600 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-07 21:00:56,062 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-07 21:00:56,293 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-07 21:00:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:00:59,165 INFO L93 Difference]: Finished difference Result 60585 states and 62162 transitions. [2019-09-07 21:00:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 21:00:59,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 2409 [2019-09-07 21:00:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:00:59,212 INFO L225 Difference]: With dead ends: 60585 [2019-09-07 21:00:59,213 INFO L226 Difference]: Without dead ends: 34196 [2019-09-07 21:00:59,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2503 GetRequests, 2444 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=692, Invalid=2968, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 21:00:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34196 states. [2019-09-07 21:00:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34196 to 30144. [2019-09-07 21:00:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30144 states. [2019-09-07 21:00:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30144 states to 30144 states and 30896 transitions. [2019-09-07 21:00:59,678 INFO L78 Accepts]: Start accepts. Automaton has 30144 states and 30896 transitions. Word has length 2409 [2019-09-07 21:00:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:00:59,679 INFO L475 AbstractCegarLoop]: Abstraction has 30144 states and 30896 transitions. [2019-09-07 21:00:59,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 21:00:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 30144 states and 30896 transitions. [2019-09-07 21:00:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2504 [2019-09-07 21:00:59,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:00:59,734 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-07 21:00:59,734 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:00:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:00:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1787313190, now seen corresponding path program 1 times [2019-09-07 21:00:59,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:00:59,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:00:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:59,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:00:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:00:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:01:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11317 backedges. 1530 proven. 6635 refuted. 0 times theorem prover too weak. 3152 trivial. 0 not checked. [2019-09-07 21:01:08,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:01:08,734 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 21:01:08,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:01:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:01:09,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 3104 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 21:01:09,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:01:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:01:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 11317 backedges. 6390 proven. 2 refuted. 0 times theorem prover too weak. 4925 trivial. 0 not checked. [2019-09-07 21:01:11,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:01:11,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 5] total 29 [2019-09-07 21:01:11,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 21:01:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 21:01:11,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2019-09-07 21:01:11,403 INFO L87 Difference]: Start difference. First operand 30144 states and 30896 transitions. Second operand 29 states. [2019-09-07 21:01:14,883 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 41 [2019-09-07 21:01:25,539 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 21:01:26,690 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-09-07 21:01:30,559 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-07 21:01:34,741 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 21:01:40,119 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-07 21:01:42,406 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 21:01:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:01:46,552 INFO L93 Difference]: Finished difference Result 59592 states and 61086 transitions. [2019-09-07 21:01:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-07 21:01:46,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 2503 [2019-09-07 21:01:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:01:46,593 INFO L225 Difference]: With dead ends: 59592 [2019-09-07 21:01:46,594 INFO L226 Difference]: Without dead ends: 32518 [2019-09-07 21:01:46,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2711 GetRequests, 2585 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6053 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2207, Invalid=14049, Unknown=0, NotChecked=0, Total=16256 [2019-09-07 21:01:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32518 states. [2019-09-07 21:01:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32518 to 31146. [2019-09-07 21:01:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31146 states. [2019-09-07 21:01:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31146 states to 31146 states and 31865 transitions. [2019-09-07 21:01:46,901 INFO L78 Accepts]: Start accepts. Automaton has 31146 states and 31865 transitions. Word has length 2503 [2019-09-07 21:01:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:01:46,902 INFO L475 AbstractCegarLoop]: Abstraction has 31146 states and 31865 transitions. [2019-09-07 21:01:46,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 21:01:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31146 states and 31865 transitions. [2019-09-07 21:01:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2528 [2019-09-07 21:01:46,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:01:46,956 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 9, 9, 9, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:01:46,956 INFO L418 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:01:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:01:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash 525514446, now seen corresponding path program 1 times [2019-09-07 21:01:46,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:01:46,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:01:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:01:46,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:01:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:01:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:01:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 11758 backedges. 2058 proven. 5618 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-09-07 21:01:58,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:01:58,424 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 21:01:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:01:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:01:58,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 3103 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:01:59,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:01:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:01:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:02:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11758 backedges. 8025 proven. 10 refuted. 0 times theorem prover too weak. 3723 trivial. 0 not checked. [2019-09-07 21:02:02,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:02:02,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 8] total 31 [2019-09-07 21:02:02,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 21:02:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 21:02:02,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2019-09-07 21:02:02,866 INFO L87 Difference]: Start difference. First operand 31146 states and 31865 transitions. Second operand 31 states. [2019-09-07 21:02:04,722 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2019-09-07 21:02:24,534 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2019-09-07 21:02:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:02:27,189 INFO L93 Difference]: Finished difference Result 61797 states and 63549 transitions. [2019-09-07 21:02:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-07 21:02:27,190 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 2527 [2019-09-07 21:02:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:02:27,240 INFO L225 Difference]: With dead ends: 61797 [2019-09-07 21:02:27,241 INFO L226 Difference]: Without dead ends: 33725 [2019-09-07 21:02:27,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2724 GetRequests, 2597 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4992 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2036, Invalid=13216, Unknown=0, NotChecked=0, Total=15252 [2019-09-07 21:02:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33725 states. [2019-09-07 21:02:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33725 to 31482. [2019-09-07 21:02:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31482 states. [2019-09-07 21:02:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31482 states to 31482 states and 32187 transitions. [2019-09-07 21:02:27,618 INFO L78 Accepts]: Start accepts. Automaton has 31482 states and 32187 transitions. Word has length 2527 [2019-09-07 21:02:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:02:27,619 INFO L475 AbstractCegarLoop]: Abstraction has 31482 states and 32187 transitions. [2019-09-07 21:02:27,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 21:02:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 31482 states and 32187 transitions. [2019-09-07 21:02:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2663 [2019-09-07 21:02:27,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:02:27,678 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:02:27,678 INFO L418 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:02:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:02:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash -404414533, now seen corresponding path program 1 times [2019-09-07 21:02:27,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:02:27,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:02:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:02:27,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:02:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:02:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:02:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12574 backedges. 2060 proven. 6846 refuted. 0 times theorem prover too weak. 3668 trivial. 0 not checked. [2019-09-07 21:02:40,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:02:40,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:02:40,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:02:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:02:41,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:02:41,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:02:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:02:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:04:19,221 WARN L188 SmtUtils]: Spent 1.49 m on a formula simplification. DAG size of input: 162 DAG size of output: 57 [2019-09-07 21:04:21,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 21:04:23,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:04:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12574 backedges. 8147 proven. 75 refuted. 0 times theorem prover too weak. 4352 trivial. 0 not checked. [2019-09-07 21:04:26,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:04:26,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8] total 34 [2019-09-07 21:04:26,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 21:04:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 21:04:26,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=992, Unknown=5, NotChecked=0, Total=1122 [2019-09-07 21:04:26,377 INFO L87 Difference]: Start difference. First operand 31482 states and 32187 transitions. Second operand 34 states. [2019-09-07 21:04:31,876 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 24 [2019-09-07 21:04:52,883 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2019-09-07 21:05:55,975 WARN L188 SmtUtils]: Spent 53.10 s on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-09-07 21:07:08,366 WARN L188 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-09-07 21:07:19,526 WARN L188 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 142 DAG size of output: 23 [2019-09-07 21:08:08,498 WARN L188 SmtUtils]: Spent 48.58 s on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2019-09-07 21:09:10,165 WARN L188 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 140 DAG size of output: 67 [2019-09-07 21:09:18,553 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-09-07 21:09:35,889 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-07 21:10:22,103 WARN L188 SmtUtils]: Spent 24.32 s on a formula simplification that was a NOOP. DAG size: 82