/usr/bin/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-fb55353 [2019-11-07 01:03:40,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:03:40,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:03:40,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:03:40,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:03:40,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:03:40,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:03:40,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:03:40,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:03:40,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:03:40,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:03:40,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:03:40,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:03:40,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:03:40,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:03:40,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:03:40,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:03:40,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:03:40,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:03:40,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:03:40,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:03:40,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:03:40,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:03:40,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:03:40,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:03:40,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:03:40,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:03:40,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:03:40,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:03:40,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:03:40,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:03:40,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:03:40,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:03:40,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:03:40,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:03:40,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:03:40,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:03:40,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:03:40,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:03:40,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:03:40,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:03:40,077 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-11-07 01:03:40,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:03:40,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:03:40,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:03:40,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:03:40,093 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:03:40,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:03:40,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:03:40,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:03:40,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:03:40,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:03:40,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:03:40,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:03:40,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:03:40,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:03:40,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:03:40,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:03:40,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:03:40,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:03:40,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:03:40,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:03:40,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:03:40,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:03:40,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:03:40,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:03:40,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:03:40,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:03:40,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:03:40,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:03:40,098 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-11-07 01:03:40,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:03:40,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:03:40,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:03:40,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:03:40,424 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:03:40,425 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-11-07 01:03:40,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efa18bf7/b9b5a6d07e9945659e90f801203fb340/FLAG17714583d [2019-11-07 01:03:41,050 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:03:41,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2019-11-07 01:03:41,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efa18bf7/b9b5a6d07e9945659e90f801203fb340/FLAG17714583d [2019-11-07 01:03:41,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6efa18bf7/b9b5a6d07e9945659e90f801203fb340 [2019-11-07 01:03:41,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:03:41,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:03:41,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:03:41,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:03:41,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:03:41,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4eb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41, skipping insertion in model container [2019-11-07 01:03:41,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,338 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:03:41,383 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:03:41,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:03:41,706 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:03:41,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:03:41,920 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:03:41,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41 WrapperNode [2019-11-07 01:03:41,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:03:41,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:03:41,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:03:41,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:03:41,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (1/1) ... [2019-11-07 01:03:41,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:03:42,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:03:42,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:03:42,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:03:42,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (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-11-07 01:03:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:03:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:03:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:03:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:03:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:03:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:03:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:03:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:03:42,924 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:03:42,924 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 01:03:42,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:42 BoogieIcfgContainer [2019-11-07 01:03:42,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:03:42,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:03:42,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:03:42,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:03:42,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:03:41" (1/3) ... [2019-11-07 01:03:42,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abd7768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:42, skipping insertion in model container [2019-11-07 01:03:42,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:41" (2/3) ... [2019-11-07 01:03:42,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abd7768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:42, skipping insertion in model container [2019-11-07 01:03:42,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:42" (3/3) ... [2019-11-07 01:03:42,951 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2019-11-07 01:03:42,964 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:03:42,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:03:42,991 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:03:43,029 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:03:43,029 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:03:43,029 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:03:43,029 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:03:43,030 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:03:43,030 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:03:43,030 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:03:43,030 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:03:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-11-07 01:03:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 01:03:43,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:43,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:43,060 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash 919157391, now seen corresponding path program 1 times [2019-11-07 01:03:43,073 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:43,074 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362078494] [2019-11-07 01:03:43,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:43,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362078494] [2019-11-07 01:03:43,237 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:43,237 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:43,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783761502] [2019-11-07 01:03:43,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:43,247 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:43,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:43,263 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-11-07 01:03:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:43,655 INFO L93 Difference]: Finished difference Result 331 states and 635 transitions. [2019-11-07 01:03:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:43,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-07 01:03:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:43,671 INFO L225 Difference]: With dead ends: 331 [2019-11-07 01:03:43,671 INFO L226 Difference]: Without dead ends: 206 [2019-11-07 01:03:43,675 INFO L630 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-11-07 01:03:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-07 01:03:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2019-11-07 01:03:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-07 01:03:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 314 transitions. [2019-11-07 01:03:43,751 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 314 transitions. Word has length 14 [2019-11-07 01:03:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:43,752 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 314 transitions. [2019-11-07 01:03:43,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 314 transitions. [2019-11-07 01:03:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 01:03:43,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:43,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:43,754 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 736602936, now seen corresponding path program 1 times [2019-11-07 01:03:43,755 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:43,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044349171] [2019-11-07 01:03:43,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:43,807 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044349171] [2019-11-07 01:03:43,807 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:43,807 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:43,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459613004] [2019-11-07 01:03:43,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:43,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:43,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:43,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:43,810 INFO L87 Difference]: Start difference. First operand 182 states and 314 transitions. Second operand 3 states. [2019-11-07 01:03:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:43,848 INFO L93 Difference]: Finished difference Result 365 states and 632 transitions. [2019-11-07 01:03:43,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:43,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-07 01:03:43,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:43,851 INFO L225 Difference]: With dead ends: 365 [2019-11-07 01:03:43,851 INFO L226 Difference]: Without dead ends: 189 [2019-11-07 01:03:43,853 INFO L630 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-11-07 01:03:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-07 01:03:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-11-07 01:03:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-07 01:03:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 322 transitions. [2019-11-07 01:03:43,867 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 322 transitions. Word has length 15 [2019-11-07 01:03:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:43,868 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 322 transitions. [2019-11-07 01:03:43,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 322 transitions. [2019-11-07 01:03:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 01:03:43,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:43,870 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:43,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash 816788357, now seen corresponding path program 1 times [2019-11-07 01:03:43,871 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:43,871 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918886086] [2019-11-07 01:03:43,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:44,310 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2019-11-07 01:03:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:44,316 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918886086] [2019-11-07 01:03:44,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:44,317 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:03:44,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781110645] [2019-11-07 01:03:44,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:03:44,320 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:44,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:03:44,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:03:44,320 INFO L87 Difference]: Start difference. First operand 189 states and 322 transitions. Second operand 4 states. [2019-11-07 01:03:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:44,634 INFO L93 Difference]: Finished difference Result 292 states and 485 transitions. [2019-11-07 01:03:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:03:44,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 01:03:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:44,638 INFO L225 Difference]: With dead ends: 292 [2019-11-07 01:03:44,638 INFO L226 Difference]: Without dead ends: 276 [2019-11-07 01:03:44,639 INFO L630 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-11-07 01:03:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-07 01:03:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 259. [2019-11-07 01:03:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-07 01:03:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 436 transitions. [2019-11-07 01:03:44,657 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 436 transitions. Word has length 21 [2019-11-07 01:03:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:44,658 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 436 transitions. [2019-11-07 01:03:44,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:03:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 436 transitions. [2019-11-07 01:03:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 01:03:44,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:44,660 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:44,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1993084704, now seen corresponding path program 1 times [2019-11-07 01:03:44,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:44,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160491178] [2019-11-07 01:03:44,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:44,713 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160491178] [2019-11-07 01:03:44,713 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:44,714 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:44,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040882732] [2019-11-07 01:03:44,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:44,715 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:44,716 INFO L87 Difference]: Start difference. First operand 259 states and 436 transitions. Second operand 3 states. [2019-11-07 01:03:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:44,764 INFO L93 Difference]: Finished difference Result 468 states and 791 transitions. [2019-11-07 01:03:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:44,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 01:03:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:44,767 INFO L225 Difference]: With dead ends: 468 [2019-11-07 01:03:44,767 INFO L226 Difference]: Without dead ends: 216 [2019-11-07 01:03:44,774 INFO L630 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-11-07 01:03:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-07 01:03:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-11-07 01:03:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-07 01:03:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 355 transitions. [2019-11-07 01:03:44,806 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 355 transitions. Word has length 22 [2019-11-07 01:03:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:44,806 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 355 transitions. [2019-11-07 01:03:44,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 355 transitions. [2019-11-07 01:03:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 01:03:44,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:44,812 INFO L410 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-11-07 01:03:44,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash -365898165, now seen corresponding path program 1 times [2019-11-07 01:03:44,815 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:44,815 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214707295] [2019-11-07 01:03:44,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:44,909 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214707295] [2019-11-07 01:03:44,909 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912728439] [2019-11-07 01:03:44,910 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-11-07 01:03:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:45,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 01:03:45,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 01:03:45,058 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 01:03:45,093 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 01:03:45,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-07 01:03:45,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279101575] [2019-11-07 01:03:45,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:03:45,095 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:03:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:03:45,095 INFO L87 Difference]: Start difference. First operand 214 states and 355 transitions. Second operand 4 states. [2019-11-07 01:03:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:45,130 INFO L93 Difference]: Finished difference Result 389 states and 646 transitions. [2019-11-07 01:03:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:45,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-07 01:03:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:45,132 INFO L225 Difference]: With dead ends: 389 [2019-11-07 01:03:45,132 INFO L226 Difference]: Without dead ends: 182 [2019-11-07 01:03:45,133 INFO L630 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-11-07 01:03:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-07 01:03:45,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-07 01:03:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-07 01:03:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 291 transitions. [2019-11-07 01:03:45,145 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 291 transitions. Word has length 28 [2019-11-07 01:03:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:45,145 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 291 transitions. [2019-11-07 01:03:45,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:03:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 291 transitions. [2019-11-07 01:03:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 01:03:45,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:45,147 INFO L410 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-11-07 01:03:45,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:45,351 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:45,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1624798356, now seen corresponding path program 1 times [2019-11-07 01:03:45,352 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:45,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069401407] [2019-11-07 01:03:45,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:45,416 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069401407] [2019-11-07 01:03:45,416 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104565490] [2019-11-07 01:03:45,416 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-11-07 01:03:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:45,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:03:45,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:45,517 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:45,539 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1326484891] [2019-11-07 01:03:45,546 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-11-07 01:03:45,614 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:03:45,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:03:45,737 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:03:46,888 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:03:46,891 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-11-07 01:03:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:46,897 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:03:46,897 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:03:46,897 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-11-07 01:03:46,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103342469] [2019-11-07 01:03:46,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:03:46,899 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:46,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:03:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:03:46,899 INFO L87 Difference]: Start difference. First operand 180 states and 291 transitions. Second operand 6 states. [2019-11-07 01:03:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:47,212 INFO L93 Difference]: Finished difference Result 524 states and 852 transitions. [2019-11-07 01:03:47,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:03:47,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-07 01:03:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:47,214 INFO L225 Difference]: With dead ends: 524 [2019-11-07 01:03:47,214 INFO L226 Difference]: Without dead ends: 371 [2019-11-07 01:03:47,215 INFO L630 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-11-07 01:03:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-07 01:03:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 314. [2019-11-07 01:03:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-07 01:03:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 533 transitions. [2019-11-07 01:03:47,227 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 533 transitions. Word has length 30 [2019-11-07 01:03:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:47,228 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 533 transitions. [2019-11-07 01:03:47,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:03:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 533 transitions. [2019-11-07 01:03:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 01:03:47,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:47,229 INFO L410 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-11-07 01:03:47,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:47,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash -944739986, now seen corresponding path program 1 times [2019-11-07 01:03:47,439 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:47,439 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295885978] [2019-11-07 01:03:47,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:47,503 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295885978] [2019-11-07 01:03:47,503 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505167411] [2019-11-07 01:03:47,503 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-11-07 01:03:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:47,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-07 01:03:47,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:47,578 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:47,592 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1039764785] [2019-11-07 01:03:47,592 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-11-07 01:03:47,594 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:03:47,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:03:47,608 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:03:47,962 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:03:47,963 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-11-07 01:03:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:47,963 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:03:47,964 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:03:47,964 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2019-11-07 01:03:47,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168015888] [2019-11-07 01:03:47,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:03:47,967 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:47,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:03:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:03:47,968 INFO L87 Difference]: Start difference. First operand 314 states and 533 transitions. Second operand 5 states. [2019-11-07 01:03:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:48,156 INFO L93 Difference]: Finished difference Result 602 states and 1030 transitions. [2019-11-07 01:03:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:03:48,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-07 01:03:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:48,164 INFO L225 Difference]: With dead ends: 602 [2019-11-07 01:03:48,164 INFO L226 Difference]: Without dead ends: 590 [2019-11-07 01:03:48,165 INFO L630 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-11-07 01:03:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-11-07 01:03:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 576. [2019-11-07 01:03:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-07 01:03:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 970 transitions. [2019-11-07 01:03:48,194 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 970 transitions. Word has length 30 [2019-11-07 01:03:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:48,195 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 970 transitions. [2019-11-07 01:03:48,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:03:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 970 transitions. [2019-11-07 01:03:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 01:03:48,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:48,203 INFO L410 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-11-07 01:03:48,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:48,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash 789275061, now seen corresponding path program 1 times [2019-11-07 01:03:48,418 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:48,418 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671202307] [2019-11-07 01:03:48,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:48,608 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671202307] [2019-11-07 01:03:48,608 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814000811] [2019-11-07 01:03:48,608 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-11-07 01:03:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:48,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-07 01:03:48,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:48,706 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:48,770 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1395429001] [2019-11-07 01:03:48,770 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-11-07 01:03:48,774 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:03:48,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:03:48,788 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:03:49,554 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:03:49,554 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-11-07 01:03:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:49,555 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:03:49,555 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:03:49,555 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-11-07 01:03:49,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332579613] [2019-11-07 01:03:49,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:03:49,556 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:03:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:03:49,557 INFO L87 Difference]: Start difference. First operand 576 states and 970 transitions. Second operand 8 states. [2019-11-07 01:03:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:49,885 INFO L93 Difference]: Finished difference Result 755 states and 1253 transitions. [2019-11-07 01:03:49,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:03:49,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-07 01:03:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:49,891 INFO L225 Difference]: With dead ends: 755 [2019-11-07 01:03:49,891 INFO L226 Difference]: Without dead ends: 738 [2019-11-07 01:03:49,892 INFO L630 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-11-07 01:03:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-11-07 01:03:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 715. [2019-11-07 01:03:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-07 01:03:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1195 transitions. [2019-11-07 01:03:49,913 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1195 transitions. Word has length 31 [2019-11-07 01:03:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:49,914 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1195 transitions. [2019-11-07 01:03:49,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:03:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1195 transitions. [2019-11-07 01:03:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-07 01:03:49,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:49,915 INFO L410 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-11-07 01:03:50,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:50,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:50,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2038890699, now seen corresponding path program 1 times [2019-11-07 01:03:50,122 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:50,122 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555812900] [2019-11-07 01:03:50,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 01:03:50,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555812900] [2019-11-07 01:03:50,157 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:50,157 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:50,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391303786] [2019-11-07 01:03:50,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:50,158 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:50,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:50,158 INFO L87 Difference]: Start difference. First operand 715 states and 1195 transitions. Second operand 3 states. [2019-11-07 01:03:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:50,200 INFO L93 Difference]: Finished difference Result 1334 states and 2217 transitions. [2019-11-07 01:03:50,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:50,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-07 01:03:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:50,205 INFO L225 Difference]: With dead ends: 1334 [2019-11-07 01:03:50,205 INFO L226 Difference]: Without dead ends: 649 [2019-11-07 01:03:50,207 INFO L630 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-11-07 01:03:50,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-07 01:03:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-11-07 01:03:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-07 01:03:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1050 transitions. [2019-11-07 01:03:50,227 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1050 transitions. Word has length 32 [2019-11-07 01:03:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:50,228 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1050 transitions. [2019-11-07 01:03:50,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1050 transitions. [2019-11-07 01:03:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 01:03:50,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:50,229 INFO L410 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-11-07 01:03:50,229 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash 820851006, now seen corresponding path program 1 times [2019-11-07 01:03:50,229 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:50,230 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433557628] [2019-11-07 01:03:50,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 01:03:50,270 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433557628] [2019-11-07 01:03:50,270 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:50,270 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:50,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563460530] [2019-11-07 01:03:50,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:50,271 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:50,272 INFO L87 Difference]: Start difference. First operand 647 states and 1050 transitions. Second operand 3 states. [2019-11-07 01:03:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:50,309 INFO L93 Difference]: Finished difference Result 1247 states and 2037 transitions. [2019-11-07 01:03:50,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:50,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-07 01:03:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:50,314 INFO L225 Difference]: With dead ends: 1247 [2019-11-07 01:03:50,314 INFO L226 Difference]: Without dead ends: 649 [2019-11-07 01:03:50,316 INFO L630 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-11-07 01:03:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-07 01:03:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 647. [2019-11-07 01:03:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-11-07 01:03:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1042 transitions. [2019-11-07 01:03:50,339 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1042 transitions. Word has length 40 [2019-11-07 01:03:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:50,340 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 1042 transitions. [2019-11-07 01:03:50,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1042 transitions. [2019-11-07 01:03:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:03:50,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:50,341 INFO L410 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-11-07 01:03:50,341 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1867136664, now seen corresponding path program 1 times [2019-11-07 01:03:50,342 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:50,342 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713537753] [2019-11-07 01:03:50,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:50,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713537753] [2019-11-07 01:03:50,611 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755114361] [2019-11-07 01:03:50,611 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-11-07 01:03:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-07 01:03:50,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:03:50,732 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:50,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:03:50,852 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1901035166] [2019-11-07 01:03:50,852 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 42 [2019-11-07 01:03:50,860 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:03:50,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:03:50,874 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:03:51,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:03:51,283 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-11-07 01:03:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:51,283 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:03:51,283 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:03:51,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2019-11-07 01:03:51,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110512259] [2019-11-07 01:03:51,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:03:51,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:03:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:03:51,285 INFO L87 Difference]: Start difference. First operand 647 states and 1042 transitions. Second operand 9 states. [2019-11-07 01:03:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:52,185 INFO L93 Difference]: Finished difference Result 1548 states and 2456 transitions. [2019-11-07 01:03:52,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 01:03:52,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-07 01:03:52,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:52,191 INFO L225 Difference]: With dead ends: 1548 [2019-11-07 01:03:52,191 INFO L226 Difference]: Without dead ends: 923 [2019-11-07 01:03:52,193 INFO L630 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-11-07 01:03:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-07 01:03:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 848. [2019-11-07 01:03:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-11-07 01:03:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1309 transitions. [2019-11-07 01:03:52,226 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1309 transitions. Word has length 41 [2019-11-07 01:03:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:52,227 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1309 transitions. [2019-11-07 01:03:52,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:03:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1309 transitions. [2019-11-07 01:03:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 01:03:52,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:52,228 INFO L410 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-11-07 01:03:52,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:52,432 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2035215205, now seen corresponding path program 1 times [2019-11-07 01:03:52,433 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:52,433 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192515163] [2019-11-07 01:03:52,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:03:52,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192515163] [2019-11-07 01:03:52,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65210227] [2019-11-07 01:03:52,523 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-11-07 01:03:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:52,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-07 01:03:52,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:03:52,625 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:03:52,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [673550174] [2019-11-07 01:03:52,642 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 43 [2019-11-07 01:03:52,644 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:03:52,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:03:52,653 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:03:54,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:03:54,188 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-11-07 01:03:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:54,188 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:03:54,189 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:03:54,189 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-11-07 01:03:54,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120872129] [2019-11-07 01:03:54,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:03:54,191 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:03:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:03:54,192 INFO L87 Difference]: Start difference. First operand 848 states and 1309 transitions. Second operand 4 states. [2019-11-07 01:03:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:54,319 INFO L93 Difference]: Finished difference Result 862 states and 1321 transitions. [2019-11-07 01:03:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:03:54,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-07 01:03:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:54,324 INFO L225 Difference]: With dead ends: 862 [2019-11-07 01:03:54,325 INFO L226 Difference]: Without dead ends: 850 [2019-11-07 01:03:54,326 INFO L630 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-11-07 01:03:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-11-07 01:03:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2019-11-07 01:03:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-11-07 01:03:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1283 transitions. [2019-11-07 01:03:54,355 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1283 transitions. Word has length 42 [2019-11-07 01:03:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:54,357 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1283 transitions. [2019-11-07 01:03:54,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:03:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1283 transitions. [2019-11-07 01:03:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 01:03:54,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:54,358 INFO L410 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-11-07 01:03:54,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:54,563 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1265387988, now seen corresponding path program 1 times [2019-11-07 01:03:54,564 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:54,564 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920402579] [2019-11-07 01:03:54,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:54,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920402579] [2019-11-07 01:03:54,808 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109370314] [2019-11-07 01:03:54,808 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-11-07 01:03:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:54,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-07 01:03:54,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:54,902 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 01:03:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 01:03:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 01:03:54,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:03:55,166 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 20 [2019-11-07 01:03:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:55,271 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [987628645] [2019-11-07 01:03:55,271 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 45 [2019-11-07 01:03:55,273 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:03:55,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:03:55,280 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:03:58,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:03:58,224 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-11-07 01:03:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:58,225 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:03:58,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:03:58,225 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2019-11-07 01:03:58,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401570300] [2019-11-07 01:03:58,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:03:58,227 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:03:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:03:58,229 INFO L87 Difference]: Start difference. First operand 848 states and 1283 transitions. Second operand 8 states. [2019-11-07 01:03:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:58,476 INFO L93 Difference]: Finished difference Result 859 states and 1291 transitions. [2019-11-07 01:03:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:03:58,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-07 01:03:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:58,481 INFO L225 Difference]: With dead ends: 859 [2019-11-07 01:03:58,482 INFO L226 Difference]: Without dead ends: 857 [2019-11-07 01:03:58,482 INFO L630 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-11-07 01:03:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-11-07 01:03:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 849. [2019-11-07 01:03:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-11-07 01:03:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1284 transitions. [2019-11-07 01:03:58,508 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1284 transitions. Word has length 44 [2019-11-07 01:03:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:58,508 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1284 transitions. [2019-11-07 01:03:58,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:03:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1284 transitions. [2019-11-07 01:03:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 01:03:58,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:58,509 INFO L410 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-11-07 01:03:58,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:58,714 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash -447084202, now seen corresponding path program 1 times [2019-11-07 01:03:58,715 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:58,715 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216470502] [2019-11-07 01:03:58,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 01:03:58,745 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216470502] [2019-11-07 01:03:58,745 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:58,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:58,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711700409] [2019-11-07 01:03:58,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:58,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:58,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:58,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:58,747 INFO L87 Difference]: Start difference. First operand 849 states and 1284 transitions. Second operand 3 states. [2019-11-07 01:03:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:58,789 INFO L93 Difference]: Finished difference Result 1689 states and 2535 transitions. [2019-11-07 01:03:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:58,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-07 01:03:58,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:58,794 INFO L225 Difference]: With dead ends: 1689 [2019-11-07 01:03:58,794 INFO L226 Difference]: Without dead ends: 889 [2019-11-07 01:03:58,796 INFO L630 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-11-07 01:03:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-11-07 01:03:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 887. [2019-11-07 01:03:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-07 01:03:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1303 transitions. [2019-11-07 01:03:58,822 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1303 transitions. Word has length 45 [2019-11-07 01:03:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:58,822 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1303 transitions. [2019-11-07 01:03:58,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1303 transitions. [2019-11-07 01:03:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 01:03:58,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:58,823 INFO L410 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-11-07 01:03:58,824 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash 810326805, now seen corresponding path program 1 times [2019-11-07 01:03:58,824 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:58,824 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962563558] [2019-11-07 01:03:58,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-07 01:03:58,864 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962563558] [2019-11-07 01:03:58,865 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:58,865 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:58,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354416350] [2019-11-07 01:03:58,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:58,866 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:58,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:58,866 INFO L87 Difference]: Start difference. First operand 887 states and 1303 transitions. Second operand 3 states. [2019-11-07 01:03:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:58,898 INFO L93 Difference]: Finished difference Result 1297 states and 1904 transitions. [2019-11-07 01:03:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:58,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 01:03:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:58,901 INFO L225 Difference]: With dead ends: 1297 [2019-11-07 01:03:58,901 INFO L226 Difference]: Without dead ends: 479 [2019-11-07 01:03:58,903 INFO L630 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-11-07 01:03:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-07 01:03:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2019-11-07 01:03:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-11-07 01:03:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 686 transitions. [2019-11-07 01:03:58,917 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 686 transitions. Word has length 57 [2019-11-07 01:03:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:58,917 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 686 transitions. [2019-11-07 01:03:58,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 686 transitions. [2019-11-07 01:03:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 01:03:58,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:58,918 INFO L410 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-11-07 01:03:58,918 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:58,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:58,919 INFO L82 PathProgramCache]: Analyzing trace with hash 933833257, now seen corresponding path program 1 times [2019-11-07 01:03:58,919 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:58,919 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19322002] [2019-11-07 01:03:58,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:03:59,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19322002] [2019-11-07 01:03:59,156 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775681889] [2019-11-07 01:03:59,156 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-11-07 01:03:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:59,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 01:03:59,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:03:59,316 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:03:59,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:03:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:03:59,390 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:03:59,390 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-11-07 01:03:59,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563812540] [2019-11-07 01:03:59,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:03:59,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:59,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:03:59,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-07 01:03:59,392 INFO L87 Difference]: Start difference. First operand 477 states and 686 transitions. Second operand 5 states. [2019-11-07 01:03:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:59,479 INFO L93 Difference]: Finished difference Result 606 states and 867 transitions. [2019-11-07 01:03:59,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:03:59,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-07 01:03:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:59,482 INFO L225 Difference]: With dead ends: 606 [2019-11-07 01:03:59,482 INFO L226 Difference]: Without dead ends: 602 [2019-11-07 01:03:59,483 INFO L630 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-11-07 01:03:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-07 01:03:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 598. [2019-11-07 01:03:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 01:03:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 859 transitions. [2019-11-07 01:03:59,502 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 859 transitions. Word has length 59 [2019-11-07 01:03:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:59,502 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 859 transitions. [2019-11-07 01:03:59,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:03:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 859 transitions. [2019-11-07 01:03:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:03:59,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:59,503 INFO L410 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-11-07 01:03:59,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:03:59,707 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1104488738, now seen corresponding path program 1 times [2019-11-07 01:03:59,708 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:59,708 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422229363] [2019-11-07 01:03:59,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:59,859 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422229363] [2019-11-07 01:03:59,859 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690453243] [2019-11-07 01:03:59,859 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-11-07 01:03:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:59,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-07 01:03:59,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:03:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:03:59,998 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:04:00,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:00,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [557501368] [2019-11-07 01:04:00,097 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 61 [2019-11-07 01:04:00,099 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:04:00,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:04:00,107 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:04:05,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:04:05,678 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-11-07 01:04:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:05,678 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:04:05,679 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:04:05,679 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2019-11-07 01:04:05,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146387642] [2019-11-07 01:04:05,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 01:04:05,681 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 01:04:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-07 01:04:05,681 INFO L87 Difference]: Start difference. First operand 598 states and 859 transitions. Second operand 13 states. [2019-11-07 01:04:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:05,920 INFO L93 Difference]: Finished difference Result 608 states and 864 transitions. [2019-11-07 01:04:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:04:05,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-11-07 01:04:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:05,923 INFO L225 Difference]: With dead ends: 608 [2019-11-07 01:04:05,924 INFO L226 Difference]: Without dead ends: 606 [2019-11-07 01:04:05,924 INFO L630 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-11-07 01:04:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-07 01:04:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-11-07 01:04:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 01:04:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 856 transitions. [2019-11-07 01:04:05,941 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 856 transitions. Word has length 60 [2019-11-07 01:04:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:05,942 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 856 transitions. [2019-11-07 01:04:05,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 01:04:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 856 transitions. [2019-11-07 01:04:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-07 01:04:05,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:05,943 INFO L410 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-11-07 01:04:06,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:04:06,156 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash 855434068, now seen corresponding path program 1 times [2019-11-07 01:04:06,156 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:06,156 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300109299] [2019-11-07 01:04:06,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:06,496 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300109299] [2019-11-07 01:04:06,496 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819040010] [2019-11-07 01:04:06,496 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-11-07 01:04:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:06,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-07 01:04:06,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:04:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:06,708 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:04:06,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:06,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:06,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:06,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 01:04:06,932 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [563396423] [2019-11-07 01:04:06,932 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 68 [2019-11-07 01:04:06,940 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:04:06,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:04:06,952 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-11-07 01:04:16,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 01:04:16,171 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-11-07 01:04:16,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:16,171 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 01:04:16,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 01:04:16,172 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2019-11-07 01:04:16,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492209958] [2019-11-07 01:04:16,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-07 01:04:16,173 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:04:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-07 01:04:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:04:16,173 INFO L87 Difference]: Start difference. First operand 598 states and 856 transitions. Second operand 15 states. [2019-11-07 01:04:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:04:17,279 INFO L93 Difference]: Finished difference Result 664 states and 913 transitions. [2019-11-07 01:04:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-07 01:04:17,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-11-07 01:04:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:04:17,282 INFO L225 Difference]: With dead ends: 664 [2019-11-07 01:04:17,282 INFO L226 Difference]: Without dead ends: 662 [2019-11-07 01:04:17,283 INFO L630 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-11-07 01:04:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-07 01:04:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 598. [2019-11-07 01:04:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 01:04:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 849 transitions. [2019-11-07 01:04:17,302 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 849 transitions. Word has length 67 [2019-11-07 01:04:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:04:17,302 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 849 transitions. [2019-11-07 01:04:17,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-07 01:04:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 849 transitions. [2019-11-07 01:04:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-07 01:04:17,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:04:17,303 INFO L410 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-11-07 01:04:17,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:04:17,507 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:04:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:04:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1100197245, now seen corresponding path program 1 times [2019-11-07 01:04:17,507 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:04:17,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908386996] [2019-11-07 01:04:17,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:04:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:04:17,805 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908386996] [2019-11-07 01:04:17,805 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091584133] [2019-11-07 01:04:17,805 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-11-07 01:04:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:04:17,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-07 01:04:17,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:04:17,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 01:04:18,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:04:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 01:04:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 01:04:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 01:04:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,305 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 20 [2019-11-07 01:04:18,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:18,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 01:04:19,776 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-11-07 01:04:19,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 01:04:20,001 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 67 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 01:04:20,001 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [255102810] [2019-11-07 01:04:20,002 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 91 [2019-11-07 01:04:20,005 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 01:04:20,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 01:04:20,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.