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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:03,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:03,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:03,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:03,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:03,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:03,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:03,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:03,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:03,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:03,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:03,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:03,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:03,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:03,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:03,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:03,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:03,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:03,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:03,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:03,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:03,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:03,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:03,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:03,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:03,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:03,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:03,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:03,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:03,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:03,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:03,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:03,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:03,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:03,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:03,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:03,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:03,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:03,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:03,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:03,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:03,848 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 21:23:03,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:03,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:03,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:03,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:03,876 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:03,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:03,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:03,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:03,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:03,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:03,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:03,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:03,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:03,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:03,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:03,881 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:03,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:03,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:03,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:03,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:03,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:03,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:03,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:03,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:03,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:03,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:03,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:03,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:03,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:23:04,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:04,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:04,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:04,184 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:04,185 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:04,185 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-13 21:23:04,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cb3e263/f63ac7d111f044d9bc9900784f3d83d0/FLAG1fcbd6436 [2019-10-13 21:23:04,799 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:04,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-10-13 21:23:04,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cb3e263/f63ac7d111f044d9bc9900784f3d83d0/FLAG1fcbd6436 [2019-10-13 21:23:05,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3cb3e263/f63ac7d111f044d9bc9900784f3d83d0 [2019-10-13 21:23:05,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:05,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:05,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:05,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:05,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:05,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef64dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05, skipping insertion in model container [2019-10-13 21:23:05,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,136 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:05,173 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:05,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:05,503 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:05,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:05,681 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:05,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05 WrapperNode [2019-10-13 21:23:05,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:05,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:05,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:05,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:05,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (1/1) ... [2019-10-13 21:23:05,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:05,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:05,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:05,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:05,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (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 21:23:05,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:05,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:05,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:23:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:06,764 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:06,764 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:23:06,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:06 BoogieIcfgContainer [2019-10-13 21:23:06,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:06,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:06,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:06,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:06,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:05" (1/3) ... [2019-10-13 21:23:06,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ed68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:06, skipping insertion in model container [2019-10-13 21:23:06,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:05" (2/3) ... [2019-10-13 21:23:06,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ed68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:06, skipping insertion in model container [2019-10-13 21:23:06,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:06" (3/3) ... [2019-10-13 21:23:06,776 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-10-13 21:23:06,787 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:06,796 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:06,809 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:06,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:06,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:06,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:06,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:06,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:06,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:06,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:06,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-13 21:23:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:23:06,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:06,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:06,874 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash 919157391, now seen corresponding path program 1 times [2019-10-13 21:23:06,891 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:06,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418410791] [2019-10-13 21:23:06,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:06,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:06,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:07,131 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 21:23:07,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418410791] [2019-10-13 21:23:07,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:07,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:07,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141246842] [2019-10-13 21:23:07,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:07,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:07,164 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-10-13 21:23:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:07,558 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2019-10-13 21:23:07,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:07,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:23:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:07,577 INFO L225 Difference]: With dead ends: 331 [2019-10-13 21:23:07,578 INFO L226 Difference]: Without dead ends: 206 [2019-10-13 21:23:07,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-13 21:23:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-10-13 21:23:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-13 21:23:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-10-13 21:23:07,643 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2019-10-13 21:23:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:07,643 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-10-13 21:23:07,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-10-13 21:23:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:23:07,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:07,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:07,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 736602936, now seen corresponding path program 1 times [2019-10-13 21:23:07,646 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:07,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633379872] [2019-10-13 21:23:07,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:07,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:07,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:07,686 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 21:23:07,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633379872] [2019-10-13 21:23:07,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:07,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:07,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192865080] [2019-10-13 21:23:07,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:07,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:07,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:07,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:07,691 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-10-13 21:23:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:07,731 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2019-10-13 21:23:07,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:07,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:23:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:07,734 INFO L225 Difference]: With dead ends: 365 [2019-10-13 21:23:07,734 INFO L226 Difference]: Without dead ends: 189 [2019-10-13 21:23:07,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-13 21:23:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-10-13 21:23:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-13 21:23:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-10-13 21:23:07,751 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2019-10-13 21:23:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:07,751 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-10-13 21:23:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-10-13 21:23:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:23:07,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:07,753 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:07,753 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash 816788357, now seen corresponding path program 1 times [2019-10-13 21:23:07,754 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:07,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808902025] [2019-10-13 21:23:07,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:07,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:07,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:08,167 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-10-13 21:23:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:08,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808902025] [2019-10-13 21:23:08,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:08,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:08,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51211123] [2019-10-13 21:23:08,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:08,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:08,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:08,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:08,183 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 4 states. [2019-10-13 21:23:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:08,530 INFO L93 Difference]: Finished difference Result 292 states and 485 transitions. [2019-10-13 21:23:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:08,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 21:23:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:08,535 INFO L225 Difference]: With dead ends: 292 [2019-10-13 21:23:08,536 INFO L226 Difference]: Without dead ends: 276 [2019-10-13 21:23:08,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-13 21:23:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-10-13 21:23:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-13 21:23:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-10-13 21:23:08,576 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2019-10-13 21:23:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:08,576 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-10-13 21:23:08,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-10-13 21:23:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:23:08,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:08,579 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:08,579 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1993084704, now seen corresponding path program 1 times [2019-10-13 21:23:08,581 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:08,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677826146] [2019-10-13 21:23:08,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:08,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:08,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:08,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677826146] [2019-10-13 21:23:08,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:08,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:08,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121643907] [2019-10-13 21:23:08,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:08,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:08,669 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-10-13 21:23:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:08,708 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2019-10-13 21:23:08,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:08,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 21:23:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:08,710 INFO L225 Difference]: With dead ends: 468 [2019-10-13 21:23:08,710 INFO L226 Difference]: Without dead ends: 216 [2019-10-13 21:23:08,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-13 21:23:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-10-13 21:23:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-13 21:23:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-10-13 21:23:08,731 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2019-10-13 21:23:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:08,733 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-10-13 21:23:08,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-10-13 21:23:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:23:08,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:08,736 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:08,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:08,737 INFO L82 PathProgramCache]: Analyzing trace with hash -365898165, now seen corresponding path program 1 times [2019-10-13 21:23:08,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:08,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490583205] [2019-10-13 21:23:08,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:08,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:08,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:08,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490583205] [2019-10-13 21:23:08,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715810813] [2019-10-13 21:23:08,811 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 21:23:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:08,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:23:08,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:23:08,971 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:23:09,000 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:23:09,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-13 21:23:09,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463016984] [2019-10-13 21:23:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:09,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:23:09,002 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 4 states. [2019-10-13 21:23:09,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:09,038 INFO L93 Difference]: Finished difference Result 389 states and 646 transitions. [2019-10-13 21:23:09,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:09,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-13 21:23:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:09,040 INFO L225 Difference]: With dead ends: 389 [2019-10-13 21:23:09,041 INFO L226 Difference]: Without dead ends: 182 [2019-10-13 21:23:09,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:23:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-13 21:23:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-10-13 21:23:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-13 21:23:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2019-10-13 21:23:09,050 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 28 [2019-10-13 21:23:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:09,051 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2019-10-13 21:23:09,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2019-10-13 21:23:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:23:09,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:09,052 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:09,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:09,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:09,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1624798356, now seen corresponding path program 1 times [2019-10-13 21:23:09,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:09,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881129070] [2019-10-13 21:23:09,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:09,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:09,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:09,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881129070] [2019-10-13 21:23:09,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103903295] [2019-10-13 21:23:09,331 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 21:23:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:09,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:23:09,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:09,405 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:09,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1587654606] [2019-10-13 21:23:09,443 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-13 21:23:09,527 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:09,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:09,695 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:10,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:10,683 INFO L272 AbstractInterpreter]: Visited 26 different actions 75 times. Merged at 18 different actions 40 times. Never widened. Performed 369 root evaluator evaluations with a maximum evaluation depth of 15. Performed 369 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-13 21:23:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:10,691 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:10,691 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:10,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-13 21:23:10,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657336363] [2019-10-13 21:23:10,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:23:10,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:10,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:23:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:23:10,702 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 6 states. [2019-10-13 21:23:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:10,975 INFO L93 Difference]: Finished difference Result 524 states and 852 transitions. [2019-10-13 21:23:10,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:23:10,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-10-13 21:23:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:10,978 INFO L225 Difference]: With dead ends: 524 [2019-10-13 21:23:10,979 INFO L226 Difference]: Without dead ends: 371 [2019-10-13 21:23:10,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:23:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-13 21:23:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 314. [2019-10-13 21:23:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-13 21:23:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 533 transitions. [2019-10-13 21:23:10,999 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 533 transitions. Word has length 30 [2019-10-13 21:23:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:11,000 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 533 transitions. [2019-10-13 21:23:11,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:23:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 533 transitions. [2019-10-13 21:23:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:23:11,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:11,005 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:11,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:11,210 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash -944739986, now seen corresponding path program 1 times [2019-10-13 21:23:11,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:11,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941928630] [2019-10-13 21:23:11,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:11,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941928630] [2019-10-13 21:23:11,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650401251] [2019-10-13 21:23:11,273 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 21:23:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:11,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:23:11,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,355 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:11,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1070207290] [2019-10-13 21:23:11,377 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-10-13 21:23:11,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:11,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:11,407 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:11,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:11,844 INFO L272 AbstractInterpreter]: Visited 25 different actions 52 times. Merged at 16 different actions 22 times. Never widened. Performed 271 root evaluator evaluations with a maximum evaluation depth of 15. Performed 271 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 4 fixpoints after 3 different actions. Largest state had 39 variables. [2019-10-13 21:23:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:11,844 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:11,845 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:11,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2019-10-13 21:23:11,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807599545] [2019-10-13 21:23:11,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:23:11,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:23:11,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:11,847 INFO L87 Difference]: Start difference. First operand 314 states and 533 transitions. Second operand 5 states. [2019-10-13 21:23:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:12,052 INFO L93 Difference]: Finished difference Result 602 states and 1030 transitions. [2019-10-13 21:23:12,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:12,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-13 21:23:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:12,058 INFO L225 Difference]: With dead ends: 602 [2019-10-13 21:23:12,059 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:23:12,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:23:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:23:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 576. [2019-10-13 21:23:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-13 21:23:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 970 transitions. [2019-10-13 21:23:12,083 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 970 transitions. Word has length 30 [2019-10-13 21:23:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:12,084 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 970 transitions. [2019-10-13 21:23:12,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:23:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 970 transitions. [2019-10-13 21:23:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:23:12,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:12,085 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:23:12,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:12,291 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash 789275061, now seen corresponding path program 1 times [2019-10-13 21:23:12,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:12,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982492338] [2019-10-13 21:23:12,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:12,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:12,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982492338] [2019-10-13 21:23:12,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52500031] [2019-10-13 21:23:12,469 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 21:23:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:12,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:23:12,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:12,577 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:12,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:12,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [454133735] [2019-10-13 21:23:12,648 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-10-13 21:23:12,654 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:12,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:12,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:13,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:13,515 INFO L272 AbstractInterpreter]: Visited 26 different actions 74 times. Merged at 19 different actions 43 times. Never widened. Performed 358 root evaluator evaluations with a maximum evaluation depth of 15. Performed 358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 5 fixpoints after 3 different actions. Largest state had 40 variables. [2019-10-13 21:23:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:13,516 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:13,516 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:13,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-10-13 21:23:13,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109571339] [2019-10-13 21:23:13,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:13,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:13,519 INFO L87 Difference]: Start difference. First operand 576 states and 970 transitions. Second operand 8 states. [2019-10-13 21:23:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:13,830 INFO L93 Difference]: Finished difference Result 755 states and 1253 transitions. [2019-10-13 21:23:13,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:23:13,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-10-13 21:23:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:13,837 INFO L225 Difference]: With dead ends: 755 [2019-10-13 21:23:13,837 INFO L226 Difference]: Without dead ends: 738 [2019-10-13 21:23:13,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-13 21:23:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 715. [2019-10-13 21:23:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-13 21:23:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1195 transitions. [2019-10-13 21:23:13,868 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1195 transitions. Word has length 31 [2019-10-13 21:23:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:13,869 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1195 transitions. [2019-10-13 21:23:13,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1195 transitions. [2019-10-13 21:23:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 21:23:13,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:13,870 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:23:14,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:14,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2038890699, now seen corresponding path program 1 times [2019-10-13 21:23:14,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:14,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650257485] [2019-10-13 21:23:14,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:14,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:14,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:23:14,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650257485] [2019-10-13 21:23:14,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:14,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:14,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838849261] [2019-10-13 21:23:14,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:14,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:14,107 INFO L87 Difference]: Start difference. First operand 715 states and 1195 transitions. Second operand 3 states. [2019-10-13 21:23:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:14,145 INFO L93 Difference]: Finished difference Result 1334 states and 2217 transitions. [2019-10-13 21:23:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:14,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 21:23:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:14,150 INFO L225 Difference]: With dead ends: 1334 [2019-10-13 21:23:14,150 INFO L226 Difference]: Without dead ends: 649 [2019-10-13 21:23:14,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-13 21:23:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-10-13 21:23:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-13 21:23:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1050 transitions. [2019-10-13 21:23:14,170 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1050 transitions. Word has length 32 [2019-10-13 21:23:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:14,171 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1050 transitions. [2019-10-13 21:23:14,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1050 transitions. [2019-10-13 21:23:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 21:23:14,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:14,172 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:14,173 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:14,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash 820851006, now seen corresponding path program 1 times [2019-10-13 21:23:14,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:14,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428753493] [2019-10-13 21:23:14,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:14,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:14,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:23:14,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428753493] [2019-10-13 21:23:14,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:14,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:14,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521279410] [2019-10-13 21:23:14,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:14,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:14,212 INFO L87 Difference]: Start difference. First operand 647 states and 1050 transitions. Second operand 3 states. [2019-10-13 21:23:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:14,249 INFO L93 Difference]: Finished difference Result 1247 states and 2037 transitions. [2019-10-13 21:23:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:14,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-13 21:23:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:14,254 INFO L225 Difference]: With dead ends: 1247 [2019-10-13 21:23:14,255 INFO L226 Difference]: Without dead ends: 649 [2019-10-13 21:23:14,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-13 21:23:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-10-13 21:23:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-13 21:23:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1042 transitions. [2019-10-13 21:23:14,274 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1042 transitions. Word has length 40 [2019-10-13 21:23:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:14,275 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1042 transitions. [2019-10-13 21:23:14,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1042 transitions. [2019-10-13 21:23:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:23:14,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:14,276 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:14,276 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:14,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1867136664, now seen corresponding path program 1 times [2019-10-13 21:23:14,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:14,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114091117] [2019-10-13 21:23:14,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:14,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:14,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:14,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114091117] [2019-10-13 21:23:14,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484324386] [2019-10-13 21:23:14,515 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 21:23:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:14,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:23:14,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:23:14,632 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:14,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:23:14,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1576259093] [2019-10-13 21:23:14,750 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 42 [2019-10-13 21:23:14,756 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:14,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:14,770 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:15,188 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:15,189 INFO L272 AbstractInterpreter]: Visited 31 different actions 72 times. Merged at 18 different actions 32 times. Never widened. Performed 357 root evaluator evaluations with a maximum evaluation depth of 15. Performed 357 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 8 fixpoints after 5 different actions. Largest state had 41 variables. [2019-10-13 21:23:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:15,190 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:15,190 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:15,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2019-10-13 21:23:15,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197694329] [2019-10-13 21:23:15,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:23:15,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:15,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:23:15,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:23:15,192 INFO L87 Difference]: Start difference. First operand 647 states and 1042 transitions. Second operand 9 states. [2019-10-13 21:23:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:16,262 INFO L93 Difference]: Finished difference Result 1548 states and 2456 transitions. [2019-10-13 21:23:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:23:16,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-10-13 21:23:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:16,270 INFO L225 Difference]: With dead ends: 1548 [2019-10-13 21:23:16,270 INFO L226 Difference]: Without dead ends: 923 [2019-10-13 21:23:16,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:23:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-10-13 21:23:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 848. [2019-10-13 21:23:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-13 21:23:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1309 transitions. [2019-10-13 21:23:16,307 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1309 transitions. Word has length 41 [2019-10-13 21:23:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:16,308 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1309 transitions. [2019-10-13 21:23:16,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:23:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1309 transitions. [2019-10-13 21:23:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 21:23:16,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:16,309 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:16,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:16,514 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2035215205, now seen corresponding path program 1 times [2019-10-13 21:23:16,515 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:16,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574947451] [2019-10-13 21:23:16,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:16,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:23:16,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574947451] [2019-10-13 21:23:16,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3638918] [2019-10-13 21:23:16,591 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 21:23:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:16,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:23:16,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:23:16,711 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:23:16,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [450262436] [2019-10-13 21:23:16,734 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 43 [2019-10-13 21:23:16,737 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:16,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:16,747 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:18,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:18,287 INFO L272 AbstractInterpreter]: Visited 32 different actions 250 times. Merged at 25 different actions 194 times. Widened at 3 different actions 10 times. Performed 1238 root evaluator evaluations with a maximum evaluation depth of 15. Performed 1238 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 22 fixpoints after 6 different actions. Largest state had 42 variables. [2019-10-13 21:23:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:18,287 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:18,287 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:18,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-10-13 21:23:18,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698951441] [2019-10-13 21:23:18,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:18,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:18,289 INFO L87 Difference]: Start difference. First operand 848 states and 1309 transitions. Second operand 4 states. [2019-10-13 21:23:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:18,417 INFO L93 Difference]: Finished difference Result 862 states and 1321 transitions. [2019-10-13 21:23:18,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:18,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-13 21:23:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:18,423 INFO L225 Difference]: With dead ends: 862 [2019-10-13 21:23:18,424 INFO L226 Difference]: Without dead ends: 850 [2019-10-13 21:23:18,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-10-13 21:23:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2019-10-13 21:23:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-13 21:23:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1283 transitions. [2019-10-13 21:23:18,456 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1283 transitions. Word has length 42 [2019-10-13 21:23:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:18,456 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1283 transitions. [2019-10-13 21:23:18,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1283 transitions. [2019-10-13 21:23:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:23:18,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:18,458 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:18,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:18,665 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1265387988, now seen corresponding path program 1 times [2019-10-13 21:23:18,666 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:18,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105365097] [2019-10-13 21:23:18,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:18,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:18,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:18,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105365097] [2019-10-13 21:23:18,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851247618] [2019-10-13 21:23:18,939 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 21:23:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:19,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 21:23:19,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:19,045 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:19,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:23:19,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:23:19,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:23:19,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:19,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:19,303 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 20 [2019-10-13 21:23:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:19,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [166344613] [2019-10-13 21:23:19,394 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 45 [2019-10-13 21:23:19,396 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:19,396 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:19,405 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:22,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:22,477 INFO L272 AbstractInterpreter]: Visited 34 different actions 184 times. Merged at 27 different actions 133 times. Widened at 2 different actions 5 times. Performed 958 root evaluator evaluations with a maximum evaluation depth of 15. Performed 958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 16 fixpoints after 7 different actions. Largest state had 44 variables. [2019-10-13 21:23:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:22,477 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:22,477 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:22,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-10-13 21:23:22,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360367101] [2019-10-13 21:23:22,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:23:22,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:22,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:23:22,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:22,479 INFO L87 Difference]: Start difference. First operand 848 states and 1283 transitions. Second operand 8 states. [2019-10-13 21:23:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:22,688 INFO L93 Difference]: Finished difference Result 859 states and 1291 transitions. [2019-10-13 21:23:22,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:23:22,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-13 21:23:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:22,693 INFO L225 Difference]: With dead ends: 859 [2019-10-13 21:23:22,693 INFO L226 Difference]: Without dead ends: 857 [2019-10-13 21:23:22,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:23:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-10-13 21:23:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 849. [2019-10-13 21:23:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-10-13 21:23:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1284 transitions. [2019-10-13 21:23:22,716 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1284 transitions. Word has length 44 [2019-10-13 21:23:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:22,717 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1284 transitions. [2019-10-13 21:23:22,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:23:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1284 transitions. [2019-10-13 21:23:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:23:22,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:22,717 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:22,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:22,923 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -447084202, now seen corresponding path program 1 times [2019-10-13 21:23:22,923 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:22,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479681088] [2019-10-13 21:23:22,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:22,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:22,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:23:22,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479681088] [2019-10-13 21:23:22,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:22,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:22,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273941386] [2019-10-13 21:23:22,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:22,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:22,959 INFO L87 Difference]: Start difference. First operand 849 states and 1284 transitions. Second operand 3 states. [2019-10-13 21:23:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:23,007 INFO L93 Difference]: Finished difference Result 1689 states and 2535 transitions. [2019-10-13 21:23:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:23,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 21:23:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:23,012 INFO L225 Difference]: With dead ends: 1689 [2019-10-13 21:23:23,012 INFO L226 Difference]: Without dead ends: 889 [2019-10-13 21:23:23,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-10-13 21:23:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 887. [2019-10-13 21:23:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-10-13 21:23:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1303 transitions. [2019-10-13 21:23:23,042 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1303 transitions. Word has length 45 [2019-10-13 21:23:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:23,043 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1303 transitions. [2019-10-13 21:23:23,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1303 transitions. [2019-10-13 21:23:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:23:23,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:23,044 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:23,044 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 810326805, now seen corresponding path program 1 times [2019-10-13 21:23:23,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:23,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51799528] [2019-10-13 21:23:23,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:23,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:23,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:23:23,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51799528] [2019-10-13 21:23:23,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:23,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:23,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623057589] [2019-10-13 21:23:23,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:23,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:23,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:23,090 INFO L87 Difference]: Start difference. First operand 887 states and 1303 transitions. Second operand 3 states. [2019-10-13 21:23:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:23,126 INFO L93 Difference]: Finished difference Result 1297 states and 1904 transitions. [2019-10-13 21:23:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:23,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 21:23:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:23,129 INFO L225 Difference]: With dead ends: 1297 [2019-10-13 21:23:23,129 INFO L226 Difference]: Without dead ends: 479 [2019-10-13 21:23:23,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-13 21:23:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2019-10-13 21:23:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-13 21:23:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 686 transitions. [2019-10-13 21:23:23,146 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 686 transitions. Word has length 57 [2019-10-13 21:23:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:23,146 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 686 transitions. [2019-10-13 21:23:23,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 686 transitions. [2019-10-13 21:23:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:23:23,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:23,147 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:23,148 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:23,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:23,148 INFO L82 PathProgramCache]: Analyzing trace with hash 933833257, now seen corresponding path program 1 times [2019-10-13 21:23:23,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:23,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045231948] [2019-10-13 21:23:23,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:23,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:23,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:23:23,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045231948] [2019-10-13 21:23:23,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605058616] [2019-10-13 21:23:23,363 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 21:23:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:23,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:23:23,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:23:23,496 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:23,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:23:23,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:23:23,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 21:23:23,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572624358] [2019-10-13 21:23:23,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:23:23,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:23:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:23:23,577 INFO L87 Difference]: Start difference. First operand 477 states and 686 transitions. Second operand 5 states. [2019-10-13 21:23:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:23,668 INFO L93 Difference]: Finished difference Result 606 states and 867 transitions. [2019-10-13 21:23:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:23,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 21:23:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:23,672 INFO L225 Difference]: With dead ends: 606 [2019-10-13 21:23:23,672 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:23:23,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:23:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:23:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-10-13 21:23:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:23:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 859 transitions. [2019-10-13 21:23:23,702 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 859 transitions. Word has length 59 [2019-10-13 21:23:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:23,703 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 859 transitions. [2019-10-13 21:23:23,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:23:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 859 transitions. [2019-10-13 21:23:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:23:23,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:23,704 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:23,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:23,907 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1104488738, now seen corresponding path program 1 times [2019-10-13 21:23:23,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:23,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265230133] [2019-10-13 21:23:23,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:23,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:23,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:24,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265230133] [2019-10-13 21:23:24,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212506408] [2019-10-13 21:23:24,124 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 21:23:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:24,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 21:23:24,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:24,267 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:24,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:24,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [355996572] [2019-10-13 21:23:24,375 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 61 [2019-10-13 21:23:24,379 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:24,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:24,388 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:29,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:29,833 INFO L272 AbstractInterpreter]: Visited 44 different actions 226 times. Merged at 37 different actions 155 times. Widened at 2 different actions 5 times. Performed 925 root evaluator evaluations with a maximum evaluation depth of 17. Performed 925 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 24 fixpoints after 10 different actions. Largest state had 50 variables. [2019-10-13 21:23:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:29,833 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:29,834 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:29,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-10-13 21:23:29,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845036394] [2019-10-13 21:23:29,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:23:29,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:29,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:23:29,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:23:29,835 INFO L87 Difference]: Start difference. First operand 598 states and 859 transitions. Second operand 13 states. [2019-10-13 21:23:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:30,087 INFO L93 Difference]: Finished difference Result 608 states and 864 transitions. [2019-10-13 21:23:30,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:23:30,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-10-13 21:23:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:30,091 INFO L225 Difference]: With dead ends: 608 [2019-10-13 21:23:30,091 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 21:23:30,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:23:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 21:23:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-10-13 21:23:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:23:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 856 transitions. [2019-10-13 21:23:30,113 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 856 transitions. Word has length 60 [2019-10-13 21:23:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:30,113 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 856 transitions. [2019-10-13 21:23:30,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:23:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 856 transitions. [2019-10-13 21:23:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 21:23:30,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:30,114 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2019-10-13 21:23:30,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:30,319 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 855434068, now seen corresponding path program 1 times [2019-10-13 21:23:30,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:30,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065753737] [2019-10-13 21:23:30,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:30,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:30,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:30,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065753737] [2019-10-13 21:23:30,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548395796] [2019-10-13 21:23:30,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:30,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:23:30,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:30,886 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:30,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:30,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:23:31,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2012306563] [2019-10-13 21:23:31,079 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 68 [2019-10-13 21:23:31,081 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:31,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:31,089 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:23:39,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:23:39,884 INFO L272 AbstractInterpreter]: Visited 45 different actions 204 times. Merged at 37 different actions 134 times. Widened at 3 different actions 6 times. Performed 991 root evaluator evaluations with a maximum evaluation depth of 17. Performed 991 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 23 fixpoints after 11 different actions. Largest state had 50 variables. [2019-10-13 21:23:39,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,885 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:23:39,885 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:23:39,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2019-10-13 21:23:39,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496232630] [2019-10-13 21:23:39,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:23:39,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:23:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:23:39,887 INFO L87 Difference]: Start difference. First operand 598 states and 856 transitions. Second operand 15 states. [2019-10-13 21:23:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,088 INFO L93 Difference]: Finished difference Result 664 states and 913 transitions. [2019-10-13 21:23:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:23:41,089 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-10-13 21:23:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,092 INFO L225 Difference]: With dead ends: 664 [2019-10-13 21:23:41,092 INFO L226 Difference]: Without dead ends: 662 [2019-10-13 21:23:41,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:23:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-13 21:23:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 598. [2019-10-13 21:23:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:23:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 849 transitions. [2019-10-13 21:23:41,118 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 849 transitions. Word has length 67 [2019-10-13 21:23:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,118 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 849 transitions. [2019-10-13 21:23:41,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:23:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 849 transitions. [2019-10-13 21:23:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:23:41,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,126 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:23:41,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:41,339 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1100197245, now seen corresponding path program 1 times [2019-10-13 21:23:41,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576071629] [2019-10-13 21:23:41,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:41,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576071629] [2019-10-13 21:23:41,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156951792] [2019-10-13 21:23:41,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:23:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 21:23:41,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:23:41,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:23:41,929 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:23:41,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:23:41,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:23:41,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 21:23:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:41,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:41,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:42,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:42,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:23:43,603 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-10-13 21:23:43,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:23:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 67 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:23:43,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1834451598] [2019-10-13 21:23:43,852 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 91 [2019-10-13 21:23:43,857 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:23:43,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:23:43,867 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.