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/Problem10_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:58:56,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:58:56,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:58:56,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:58:56,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:58:56,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:58:56,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:58:56,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:58:56,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:58:56,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:58:56,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:58:56,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:58:56,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:58:56,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:58:56,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:58:56,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:58:56,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:58:56,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:58:56,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:58:56,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:58:56,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:58:56,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:58:56,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:58:56,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:58:56,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:58:56,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:58:56,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:58:56,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:58:56,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:58:56,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:58:56,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:58:56,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:58:56,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:58:56,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:58:56,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:58:56,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:58:56,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:58:56,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:58:56,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:58:56,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:58:56,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:58:56,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 17:58:56,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:58:56,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:58:56,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:58:56,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:58:56,783 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:58:56,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:58:56,784 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:58:56,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:58:56,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:58:56,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:58:56,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:58:56,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:58:56,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:58:56,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:58:56,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:58:56,786 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:58:56,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:58:56,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:58:56,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:58:56,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:58:56,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:58:56,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:58:56,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:58:56,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:58:56,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:58:56,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:58:56,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:58:56,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:58:56,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:58:57,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:58:57,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:58:57,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:58:57,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:58:57,100 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:58:57,100 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2019-10-13 17:58:57,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf0d858c/8ea9ccc5eb994ddc9884629aeeabd51a/FLAG7d5aa615e [2019-10-13 17:58:57,749 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:58:57,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2019-10-13 17:58:57,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf0d858c/8ea9ccc5eb994ddc9884629aeeabd51a/FLAG7d5aa615e [2019-10-13 17:58:58,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf0d858c/8ea9ccc5eb994ddc9884629aeeabd51a [2019-10-13 17:58:58,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:58:58,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:58:58,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:58:58,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:58:58,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:58:58,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7954cf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58, skipping insertion in model container [2019-10-13 17:58:58,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,050 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:58:58,104 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:58:58,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:58:58,637 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:58:58,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:58:58,838 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:58:58,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58 WrapperNode [2019-10-13 17:58:58,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:58:58,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:58:58,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:58:58,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:58:58,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... [2019-10-13 17:58:58,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:58:58,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:58:58,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:58:58,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:58:58,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:58:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:58:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:58:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 17:58:59,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:58:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 17:58:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:58:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:58:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 17:58:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:58:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:58:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:59:00,314 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:59:00,314 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 17:59:00,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:59:00 BoogieIcfgContainer [2019-10-13 17:59:00,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:59:00,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:59:00,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:59:00,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:59:00,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:58" (1/3) ... [2019-10-13 17:59:00,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e30b6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:59:00, skipping insertion in model container [2019-10-13 17:59:00,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:58" (2/3) ... [2019-10-13 17:59:00,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e30b6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:59:00, skipping insertion in model container [2019-10-13 17:59:00,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:59:00" (3/3) ... [2019-10-13 17:59:00,332 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2019-10-13 17:59:00,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:59:00,349 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:59:00,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:59:00,391 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:59:00,391 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:59:00,391 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:59:00,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:59:00,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:59:00,392 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:59:00,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:59:00,392 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:59:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-10-13 17:59:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 17:59:00,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:00,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:00,439 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 397772918, now seen corresponding path program 1 times [2019-10-13 17:59:00,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:00,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833875481] [2019-10-13 17:59:00,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:00,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:00,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:00,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833875481] [2019-10-13 17:59:00,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:00,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:59:00,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918172855] [2019-10-13 17:59:00,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:59:00,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:00,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:59:00,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:59:00,814 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2019-10-13 17:59:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:02,762 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2019-10-13 17:59:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:59:02,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 17:59:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:02,782 INFO L225 Difference]: With dead ends: 730 [2019-10-13 17:59:02,782 INFO L226 Difference]: Without dead ends: 447 [2019-10-13 17:59:02,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-13 17:59:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2019-10-13 17:59:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-13 17:59:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2019-10-13 17:59:02,889 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 15 [2019-10-13 17:59:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:02,890 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2019-10-13 17:59:02,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:59:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2019-10-13 17:59:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 17:59:02,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:02,900 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 17:59:02,900 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1068134291, now seen corresponding path program 1 times [2019-10-13 17:59:02,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:02,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968909812] [2019-10-13 17:59:02,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:02,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:02,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:03,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968909812] [2019-10-13 17:59:03,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:03,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:59:03,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977716374] [2019-10-13 17:59:03,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:03,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:03,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:03,224 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 9 states. [2019-10-13 17:59:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:04,724 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2019-10-13 17:59:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:59:04,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-13 17:59:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:04,731 INFO L225 Difference]: With dead ends: 1041 [2019-10-13 17:59:04,732 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 17:59:04,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 17:59:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 17:59:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2019-10-13 17:59:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 17:59:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2019-10-13 17:59:04,772 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 88 [2019-10-13 17:59:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:04,773 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2019-10-13 17:59:04,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2019-10-13 17:59:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 17:59:04,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:04,777 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 17:59:04,777 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1363459929, now seen corresponding path program 1 times [2019-10-13 17:59:04,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:04,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834668596] [2019-10-13 17:59:04,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:04,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:04,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:04,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834668596] [2019-10-13 17:59:04,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238988640] [2019-10-13 17:59:04,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:05,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:05,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:05,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:05,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:05,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353608971] [2019-10-13 17:59:05,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:05,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:05,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:05,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:05,101 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 3 states. [2019-10-13 17:59:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:05,710 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2019-10-13 17:59:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:05,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-13 17:59:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:05,717 INFO L225 Difference]: With dead ends: 1615 [2019-10-13 17:59:05,717 INFO L226 Difference]: Without dead ends: 1029 [2019-10-13 17:59:05,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-10-13 17:59:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2019-10-13 17:59:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-10-13 17:59:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2019-10-13 17:59:05,758 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 94 [2019-10-13 17:59:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:05,759 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2019-10-13 17:59:05,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2019-10-13 17:59:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 17:59:05,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:05,766 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 17:59:05,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:05,981 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash -396385674, now seen corresponding path program 1 times [2019-10-13 17:59:05,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:05,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777282778] [2019-10-13 17:59:05,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:05,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:05,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:06,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777282778] [2019-10-13 17:59:06,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:59:06,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 17:59:06,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707441324] [2019-10-13 17:59:06,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:06,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:06,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:06,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:06,401 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand 9 states. [2019-10-13 17:59:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:08,144 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2019-10-13 17:59:08,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 17:59:08,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-10-13 17:59:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:08,156 INFO L225 Difference]: With dead ends: 2245 [2019-10-13 17:59:08,156 INFO L226 Difference]: Without dead ends: 1365 [2019-10-13 17:59:08,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:59:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-10-13 17:59:08,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2019-10-13 17:59:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-10-13 17:59:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1317 transitions. [2019-10-13 17:59:08,202 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1317 transitions. Word has length 151 [2019-10-13 17:59:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:08,203 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 1317 transitions. [2019-10-13 17:59:08,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1317 transitions. [2019-10-13 17:59:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-13 17:59:08,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:08,206 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:08,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1385846678, now seen corresponding path program 1 times [2019-10-13 17:59:08,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:08,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045825953] [2019-10-13 17:59:08,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:08,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:08,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:08,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045825953] [2019-10-13 17:59:08,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791482810] [2019-10-13 17:59:08,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:08,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:08,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 84 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:08,620 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:08,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-13 17:59:08,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905296881] [2019-10-13 17:59:08,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:59:08,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:59:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:59:08,623 INFO L87 Difference]: Start difference. First operand 1057 states and 1317 transitions. Second operand 11 states. [2019-10-13 17:59:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:11,896 INFO L93 Difference]: Finished difference Result 2933 states and 4043 transitions. [2019-10-13 17:59:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 17:59:11,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-10-13 17:59:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:11,910 INFO L225 Difference]: With dead ends: 2933 [2019-10-13 17:59:11,911 INFO L226 Difference]: Without dead ends: 1882 [2019-10-13 17:59:11,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-10-13 17:59:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-10-13 17:59:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1548. [2019-10-13 17:59:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-13 17:59:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1966 transitions. [2019-10-13 17:59:11,978 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1966 transitions. Word has length 175 [2019-10-13 17:59:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:11,979 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 1966 transitions. [2019-10-13 17:59:11,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:59:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1966 transitions. [2019-10-13 17:59:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 17:59:11,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:11,982 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:12,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:12,193 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:12,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2064509357, now seen corresponding path program 1 times [2019-10-13 17:59:12,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:12,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213191425] [2019-10-13 17:59:12,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:12,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:12,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-13 17:59:12,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213191425] [2019-10-13 17:59:12,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88912819] [2019-10-13 17:59:12,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:12,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:12,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 17:59:12,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:12,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-13 17:59:12,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096933181] [2019-10-13 17:59:12,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:12,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:12,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:12,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:12,593 INFO L87 Difference]: Start difference. First operand 1548 states and 1966 transitions. Second operand 3 states. [2019-10-13 17:59:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:13,231 INFO L93 Difference]: Finished difference Result 3237 states and 4164 transitions. [2019-10-13 17:59:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:13,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-13 17:59:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:13,245 INFO L225 Difference]: With dead ends: 3237 [2019-10-13 17:59:13,246 INFO L226 Difference]: Without dead ends: 1695 [2019-10-13 17:59:13,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:59:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-10-13 17:59:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1544. [2019-10-13 17:59:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-10-13 17:59:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1916 transitions. [2019-10-13 17:59:13,306 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1916 transitions. Word has length 192 [2019-10-13 17:59:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:13,306 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1916 transitions. [2019-10-13 17:59:13,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1916 transitions. [2019-10-13 17:59:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-13 17:59:13,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:13,312 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:13,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:13,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash 539367001, now seen corresponding path program 1 times [2019-10-13 17:59:13,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:13,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481993861] [2019-10-13 17:59:13,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:13,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:13,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:13,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481993861] [2019-10-13 17:59:13,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781693331] [2019-10-13 17:59:13,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:14,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:14,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:14,114 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:14,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2019-10-13 17:59:14,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043898048] [2019-10-13 17:59:14,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 17:59:14,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 17:59:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:59:14,119 INFO L87 Difference]: Start difference. First operand 1544 states and 1916 transitions. Second operand 13 states. [2019-10-13 17:59:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:17,682 INFO L93 Difference]: Finished difference Result 4866 states and 6072 transitions. [2019-10-13 17:59:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 17:59:17,682 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-10-13 17:59:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:17,692 INFO L225 Difference]: With dead ends: 4866 [2019-10-13 17:59:17,692 INFO L226 Difference]: Without dead ends: 1977 [2019-10-13 17:59:17,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2019-10-13 17:59:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-10-13 17:59:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1524. [2019-10-13 17:59:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-10-13 17:59:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1757 transitions. [2019-10-13 17:59:17,755 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1757 transitions. Word has length 230 [2019-10-13 17:59:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:17,755 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 1757 transitions. [2019-10-13 17:59:17,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 17:59:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1757 transitions. [2019-10-13 17:59:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-13 17:59:17,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:17,761 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:17,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:17,967 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1113807393, now seen corresponding path program 1 times [2019-10-13 17:59:17,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:17,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877218013] [2019-10-13 17:59:17,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:17,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:17,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:18,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877218013] [2019-10-13 17:59:18,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070650138] [2019-10-13 17:59:18,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:18,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:59:18,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:59:18,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:18,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-13 17:59:18,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116856762] [2019-10-13 17:59:18,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:59:18,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:59:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:59:18,556 INFO L87 Difference]: Start difference. First operand 1524 states and 1757 transitions. Second operand 11 states. [2019-10-13 17:59:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:20,402 INFO L93 Difference]: Finished difference Result 2738 states and 3125 transitions. [2019-10-13 17:59:20,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 17:59:20,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2019-10-13 17:59:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:20,408 INFO L225 Difference]: With dead ends: 2738 [2019-10-13 17:59:20,409 INFO L226 Difference]: Without dead ends: 1363 [2019-10-13 17:59:20,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-10-13 17:59:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-10-13 17:59:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1198. [2019-10-13 17:59:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-13 17:59:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1300 transitions. [2019-10-13 17:59:20,443 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1300 transitions. Word has length 234 [2019-10-13 17:59:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:20,444 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1300 transitions. [2019-10-13 17:59:20,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:59:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1300 transitions. [2019-10-13 17:59:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-13 17:59:20,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:20,449 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:20,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:20,657 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1472473771, now seen corresponding path program 1 times [2019-10-13 17:59:20,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:20,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30746223] [2019-10-13 17:59:20,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:20,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:20,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:59:21,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30746223] [2019-10-13 17:59:21,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690915469] [2019-10-13 17:59:21,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:21,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 17:59:21,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 17:59:21,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:21,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-10-13 17:59:21,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597659024] [2019-10-13 17:59:21,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:59:21,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:59:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:59:21,404 INFO L87 Difference]: Start difference. First operand 1198 states and 1300 transitions. Second operand 5 states. [2019-10-13 17:59:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:22,208 INFO L93 Difference]: Finished difference Result 2561 states and 2778 transitions. [2019-10-13 17:59:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:59:22,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-10-13 17:59:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:22,213 INFO L225 Difference]: With dead ends: 2561 [2019-10-13 17:59:22,213 INFO L226 Difference]: Without dead ends: 1369 [2019-10-13 17:59:22,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:59:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-10-13 17:59:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1345. [2019-10-13 17:59:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-10-13 17:59:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1454 transitions. [2019-10-13 17:59:22,245 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1454 transitions. Word has length 244 [2019-10-13 17:59:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:22,245 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1454 transitions. [2019-10-13 17:59:22,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:59:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1454 transitions. [2019-10-13 17:59:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-13 17:59:22,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:22,250 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:59:22,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:22,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash -744935455, now seen corresponding path program 1 times [2019-10-13 17:59:22,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:22,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480697928] [2019-10-13 17:59:22,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:22,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:22,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-13 17:59:22,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480697928] [2019-10-13 17:59:22,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908578521] [2019-10-13 17:59:22,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:22,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 17:59:22,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:22,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 17:59:23,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 17:59:23,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-10-13 17:59:23,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526055931] [2019-10-13 17:59:23,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:59:23,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:59:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:59:23,036 INFO L87 Difference]: Start difference. First operand 1345 states and 1454 transitions. Second operand 3 states. [2019-10-13 17:59:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:23,603 INFO L93 Difference]: Finished difference Result 3115 states and 3396 transitions. [2019-10-13 17:59:23,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:59:23,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-10-13 17:59:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:23,609 INFO L225 Difference]: With dead ends: 3115 [2019-10-13 17:59:23,610 INFO L226 Difference]: Without dead ends: 1774 [2019-10-13 17:59:23,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:59:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-10-13 17:59:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1486. [2019-10-13 17:59:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2019-10-13 17:59:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1600 transitions. [2019-10-13 17:59:23,646 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1600 transitions. Word has length 266 [2019-10-13 17:59:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:23,647 INFO L462 AbstractCegarLoop]: Abstraction has 1486 states and 1600 transitions. [2019-10-13 17:59:23,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:59:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1600 transitions. [2019-10-13 17:59:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-13 17:59:23,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:23,652 INFO L380 BasicCegarLoop]: trace histogram [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, 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] [2019-10-13 17:59:23,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:23,856 INFO L410 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:23,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1813224930, now seen corresponding path program 1 times [2019-10-13 17:59:23,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:23,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755984221] [2019-10-13 17:59:23,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:23,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:23,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-13 17:59:24,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755984221] [2019-10-13 17:59:24,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587519906] [2019-10-13 17:59:24,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:24,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 17:59:24,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:24,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:59:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-13 17:59:24,383 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:59:24,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-13 17:59:24,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354049741] [2019-10-13 17:59:24,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 17:59:24,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:59:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 17:59:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:59:24,386 INFO L87 Difference]: Start difference. First operand 1486 states and 1600 transitions. Second operand 9 states. [2019-10-13 17:59:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:59:27,067 INFO L93 Difference]: Finished difference Result 4619 states and 5207 transitions. [2019-10-13 17:59:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 17:59:27,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 275 [2019-10-13 17:59:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:59:27,080 INFO L225 Difference]: With dead ends: 4619 [2019-10-13 17:59:27,081 INFO L226 Difference]: Without dead ends: 3135 [2019-10-13 17:59:27,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-10-13 17:59:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-10-13 17:59:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2944. [2019-10-13 17:59:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-10-13 17:59:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3193 transitions. [2019-10-13 17:59:27,161 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3193 transitions. Word has length 275 [2019-10-13 17:59:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:59:27,162 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 3193 transitions. [2019-10-13 17:59:27,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 17:59:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3193 transitions. [2019-10-13 17:59:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-10-13 17:59:27,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:59:27,171 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 17:59:27,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:27,375 INFO L410 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:59:27,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:59:27,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1033916999, now seen corresponding path program 1 times [2019-10-13 17:59:27,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:59:27,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603813551] [2019-10-13 17:59:27,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:27,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:59:27,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:59:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-13 17:59:28,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603813551] [2019-10-13 17:59:28,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479994361] [2019-10-13 17:59:28,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:59:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:59:28,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 17:59:28,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:59:28,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:59:28,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms