java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:59:15,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:59:15,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:59:15,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:59:15,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:59:15,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:59:15,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:59:15,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:59:15,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:59:15,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:59:15,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:59:15,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:59:15,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:59:15,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:59:15,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:59:15,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:59:15,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:59:15,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:59:15,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:59:15,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:59:15,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:59:15,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:59:15,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:59:15,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:59:15,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:59:15,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:59:15,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:59:15,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:59:15,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:59:15,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:59:15,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:59:15,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:59:15,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:59:15,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:59:15,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:59:15,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:59:15,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:59:15,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:59:15,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:59:15,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:59:16,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:59:16,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:59:16,015 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:59:16,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:59:16,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:59:16,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:59:16,016 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:59:16,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:59:16,017 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:59:16,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:59:16,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:59:16,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:59:16,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:59:16,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:59:16,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:59:16,018 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:59:16,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:59:16,018 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:59:16,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:59:16,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:59:16,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:59:16,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:59:16,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:59:16,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:59:16,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:59:16,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:59:16,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:59:16,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:59:16,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:59:16,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:59:16,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:59:16,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:59:16,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:59:16,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:59:16,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:59:16,070 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:59:16,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2019-09-05 11:59:16,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0603628/fbdcbb0dfe3646e5ad003a6e6e662e9b/FLAGd91b8453a [2019-09-05 11:59:16,563 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:59:16,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2019-09-05 11:59:16,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0603628/fbdcbb0dfe3646e5ad003a6e6e662e9b/FLAGd91b8453a [2019-09-05 11:59:16,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0603628/fbdcbb0dfe3646e5ad003a6e6e662e9b [2019-09-05 11:59:16,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:59:16,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:59:16,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:16,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:59:16,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:59:16,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:16" (1/1) ... [2019-09-05 11:59:16,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cedd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:16, skipping insertion in model container [2019-09-05 11:59:16,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:16" (1/1) ... [2019-09-05 11:59:16,991 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:59:17,005 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:59:17,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:17,187 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:59:17,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:17,214 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:59:17,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17 WrapperNode [2019-09-05 11:59:17,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:17,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:59:17,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:59:17,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:59:17,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... [2019-09-05 11:59:17,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:59:17,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:59:17,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:59:17,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:59:17,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:59:17,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:59:17,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:59:17,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:59:17,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:59:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:59:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:59:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:59:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:59:17,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:59:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:59:17,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:59:17,564 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:59:17,564 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 11:59:17,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:17 BoogieIcfgContainer [2019-09-05 11:59:17,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:59:17,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:59:17,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:59:17,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:59:17,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:59:16" (1/3) ... [2019-09-05 11:59:17,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e86770a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:17, skipping insertion in model container [2019-09-05 11:59:17,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:17" (2/3) ... [2019-09-05 11:59:17,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e86770a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:17, skipping insertion in model container [2019-09-05 11:59:17,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:17" (3/3) ... [2019-09-05 11:59:17,573 INFO L109 eAbstractionObserver]: Analyzing ICFG half_2.i [2019-09-05 11:59:17,581 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:59:17,588 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:59:17,604 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:59:17,634 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:59:17,635 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:59:17,635 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:59:17,636 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:59:17,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:59:17,636 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:59:17,636 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:59:17,637 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:59:17,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:59:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-05 11:59:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:59:17,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:17,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:17,661 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash -351980134, now seen corresponding path program 1 times [2019-09-05 11:59:17,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:17,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:17,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:17,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:17,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:59:17,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:59:17,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:59:17,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:59:17,788 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-05 11:59:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:17,811 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-09-05 11:59:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:59:17,812 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-05 11:59:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:17,820 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:59:17,820 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:59:17,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:59:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:59:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:59:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:59:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-05 11:59:17,870 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-09-05 11:59:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:17,870 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-05 11:59:17,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:59:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-05 11:59:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:59:17,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:17,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:17,873 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:17,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:17,875 INFO L82 PathProgramCache]: Analyzing trace with hash 392972438, now seen corresponding path program 1 times [2019-09-05 11:59:17,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:17,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:18,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:18,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-05 11:59:18,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:59:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:59:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:18,121 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-09-05 11:59:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:18,280 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-05 11:59:18,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:59:18,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 11:59:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:18,282 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:59:18,282 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:59:18,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:59:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:59:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:59:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:59:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-05 11:59:18,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-09-05 11:59:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:18,289 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-05 11:59:18,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:59:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-05 11:59:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:59:18,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:18,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:18,291 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1474350191, now seen corresponding path program 1 times [2019-09-05 11:59:18,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:18,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:18,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:18,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:18,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:18,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:59:18,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:18,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:18,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:18,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:18,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:18,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-09-05 11:59:18,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:59:18,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:59:18,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:59:18,616 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 11 states. [2019-09-05 11:59:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:18,770 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-09-05 11:59:18,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:59:18,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-09-05 11:59:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:18,773 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:59:18,773 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:59:18,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:59:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:59:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 11:59:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:59:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-05 11:59:18,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2019-09-05 11:59:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:18,782 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-05 11:59:18,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:59:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-05 11:59:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:59:18,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:18,784 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:18,784 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash 637322166, now seen corresponding path program 2 times [2019-09-05 11:59:18,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:18,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:18,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:18,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:18,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:18,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:18,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:18,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:59:18,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:18,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:18,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:18,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-05 11:59:18,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:59:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:59:18,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:59:18,993 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2019-09-05 11:59:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:19,076 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-09-05 11:59:19,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:59:19,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-09-05 11:59:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:19,079 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:59:19,079 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:59:19,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:59:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:59:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-09-05 11:59:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:59:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-05 11:59:19,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-09-05 11:59:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:19,090 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-05 11:59:19,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:59:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-05 11:59:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:59:19,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:19,092 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:19,092 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 326029073, now seen corresponding path program 1 times [2019-09-05 11:59:19,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:19,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:19,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:19,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:19,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:19,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:19,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:59:19,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:19,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:19,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:19,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:19,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:19,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:19,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2019-09-05 11:59:19,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:59:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:59:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:59:19,726 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 18 states. [2019-09-05 11:59:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:20,041 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-09-05 11:59:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:59:20,043 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-09-05 11:59:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:20,046 INFO L225 Difference]: With dead ends: 46 [2019-09-05 11:59:20,046 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 11:59:20,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:59:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 11:59:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 11:59:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:59:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-09-05 11:59:20,053 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2019-09-05 11:59:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:20,054 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-09-05 11:59:20,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:59:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-09-05 11:59:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:59:20,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:20,055 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:20,055 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:20,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1130459304, now seen corresponding path program 2 times [2019-09-05 11:59:20,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:20,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:20,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:20,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:20,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:20,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:20,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:20,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:59:20,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:20,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:20,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:20,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-05 11:59:20,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:59:20,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:59:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:59:20,266 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-09-05 11:59:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:20,444 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-05 11:59:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:59:20,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-09-05 11:59:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:20,446 INFO L225 Difference]: With dead ends: 39 [2019-09-05 11:59:20,446 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:59:20,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:59:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:59:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2019-09-05 11:59:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:59:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-05 11:59:20,459 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2019-09-05 11:59:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:20,460 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-05 11:59:20,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:59:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-05 11:59:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:59:20,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:20,463 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:20,463 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1086392623, now seen corresponding path program 3 times [2019-09-05 11:59:20,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:20,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:20,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:59:20,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:20,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:20,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:59:20,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:20,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-05 11:59:20,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:20,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:59:21,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:21,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2019-09-05 11:59:21,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:59:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:59:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:59:21,022 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 22 states. [2019-09-05 11:59:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:21,408 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-05 11:59:21,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:59:21,409 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-09-05 11:59:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:21,410 INFO L225 Difference]: With dead ends: 65 [2019-09-05 11:59:21,410 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:59:21,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:59:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:59:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2019-09-05 11:59:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:59:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-05 11:59:21,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2019-09-05 11:59:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:21,418 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-05 11:59:21,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:59:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-05 11:59:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-05 11:59:21,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:21,419 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:21,419 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1121217930, now seen corresponding path program 4 times [2019-09-05 11:59:21,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:21,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:59:21,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:21,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:21,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:21,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:21,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:59:21,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:59:21,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:21,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 18 [2019-09-05 11:59:21,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:59:21,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:59:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:59:21,660 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 18 states. [2019-09-05 11:59:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:21,933 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-09-05 11:59:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:59:21,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-09-05 11:59:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:21,935 INFO L225 Difference]: With dead ends: 47 [2019-09-05 11:59:21,935 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 11:59:21,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:59:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 11:59:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-09-05 11:59:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:59:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-05 11:59:21,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 31 [2019-09-05 11:59:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:21,942 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-05 11:59:21,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:59:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-05 11:59:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:59:21,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:21,944 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:21,944 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash -948049839, now seen corresponding path program 5 times [2019-09-05 11:59:21,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:21,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 11:59:22,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:22,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:22,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:22,287 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:59:22,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:22,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:59:22,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:22,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:22,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:22,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:22,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 11:59:22,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:22,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 25 [2019-09-05 11:59:22,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:59:22,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:59:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:59:22,570 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 25 states. [2019-09-05 11:59:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:23,085 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-09-05 11:59:23,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:59:23,085 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2019-09-05 11:59:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:23,086 INFO L225 Difference]: With dead ends: 80 [2019-09-05 11:59:23,086 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 11:59:23,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:59:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 11:59:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-09-05 11:59:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:59:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-09-05 11:59:23,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2019-09-05 11:59:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:23,095 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-09-05 11:59:23,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:59:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-09-05 11:59:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-05 11:59:23,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:23,096 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:23,096 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash -129353064, now seen corresponding path program 6 times [2019-09-05 11:59:23,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:23,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:23,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:23,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:23,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 11:59:23,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:23,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:23,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:23,230 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-05 11:59:23,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:23,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:59:23,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 11:59:23,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:23,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2019-09-05 11:59:23,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:59:23,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:59:23,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:59:23,375 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 20 states. [2019-09-05 11:59:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:23,652 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-09-05 11:59:23,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:59:23,652 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2019-09-05 11:59:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:23,653 INFO L225 Difference]: With dead ends: 55 [2019-09-05 11:59:23,654 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 11:59:23,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:59:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 11:59:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-09-05 11:59:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 11:59:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-05 11:59:23,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 39 [2019-09-05 11:59:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:23,668 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-05 11:59:23,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:59:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-05 11:59:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:59:23,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:23,671 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:23,671 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -379409, now seen corresponding path program 7 times [2019-09-05 11:59:23,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:23,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:23,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:23,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:23,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 11:59:24,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:24,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:24,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:59:24,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:24,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:24,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:24,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:24,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:24,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:24,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2019-09-05 11:59:24,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:59:24,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:59:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:59:24,406 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 29 states. [2019-09-05 11:59:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:25,086 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-09-05 11:59:25,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:59:25,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2019-09-05 11:59:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:25,089 INFO L225 Difference]: With dead ends: 95 [2019-09-05 11:59:25,089 INFO L226 Difference]: Without dead ends: 58 [2019-09-05 11:59:25,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2019-09-05 11:59:25,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-05 11:59:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2019-09-05 11:59:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 11:59:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-09-05 11:59:25,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2019-09-05 11:59:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:25,099 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-09-05 11:59:25,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:59:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-09-05 11:59:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-05 11:59:25,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:25,100 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:25,100 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1353756362, now seen corresponding path program 8 times [2019-09-05 11:59:25,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:25,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 11:59:25,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:25,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:25,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:25,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:25,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:25,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:59:25,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:25,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 11:59:25,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2019-09-05 11:59:25,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:59:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:59:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:59:25,415 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 23 states. [2019-09-05 11:59:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:25,770 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-09-05 11:59:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:59:25,770 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-09-05 11:59:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:25,771 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:59:25,771 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 11:59:25,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:59:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 11:59:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-09-05 11:59:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 11:59:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-05 11:59:25,790 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 47 [2019-09-05 11:59:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:25,791 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-05 11:59:25,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:59:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-05 11:59:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:59:25,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:25,792 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:25,792 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1070984815, now seen corresponding path program 9 times [2019-09-05 11:59:25,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:25,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 40 proven. 31 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 11:59:26,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:26,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:26,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:26,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:59:26,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:26,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:59:26,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:26,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-05 11:59:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:26,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2019-09-05 11:59:26,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:59:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:59:26,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:59:26,821 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2019-09-05 11:59:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:27,658 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2019-09-05 11:59:27,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:59:27,659 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2019-09-05 11:59:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:27,662 INFO L225 Difference]: With dead ends: 110 [2019-09-05 11:59:27,662 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 11:59:27,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=1604, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:59:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 11:59:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-09-05 11:59:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 11:59:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-05 11:59:27,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2019-09-05 11:59:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:27,673 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-05 11:59:27,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:59:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-05 11:59:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 11:59:27,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:27,674 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:27,674 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1590757928, now seen corresponding path program 10 times [2019-09-05 11:59:27,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:27,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:27,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 31 proven. 47 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-05 11:59:27,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:27,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:27,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:27,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:27,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:27,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 11:59:27,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:28,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-05 11:59:28,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:28,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 27 [2019-09-05 11:59:28,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:59:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:59:28,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:59:28,073 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 27 states. [2019-09-05 11:59:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:28,622 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-05 11:59:28,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:59:28,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-09-05 11:59:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:28,625 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:59:28,625 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:59:28,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:59:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:59:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-09-05 11:59:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-05 11:59:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-09-05 11:59:28,634 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 55 [2019-09-05 11:59:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:28,634 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-09-05 11:59:28,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:59:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-09-05 11:59:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 11:59:28,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:28,635 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:28,636 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1029156177, now seen corresponding path program 11 times [2019-09-05 11:59:28,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:28,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 57 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:59:29,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:29,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:29,159 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:59:29,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:29,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:59:29,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:29,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:29,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:29,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:29,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 86 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-05 11:59:29,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:29,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 31 [2019-09-05 11:59:29,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:59:29,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:59:29,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:59:29,537 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 31 states. [2019-09-05 11:59:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:30,308 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-09-05 11:59:30,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:59:30,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2019-09-05 11:59:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:30,310 INFO L225 Difference]: With dead ends: 125 [2019-09-05 11:59:30,311 INFO L226 Difference]: Without dead ends: 74 [2019-09-05 11:59:30,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:59:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-05 11:59:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2019-09-05 11:59:30,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 11:59:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-09-05 11:59:30,320 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-09-05 11:59:30,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:30,320 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-09-05 11:59:30,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:59:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-09-05 11:59:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-05 11:59:30,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:30,321 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:30,321 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:30,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1904476150, now seen corresponding path program 12 times [2019-09-05 11:59:30,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:30,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:30,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 40 proven. 65 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-05 11:59:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:30,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:30,537 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:30,572 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:59:30,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:30,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:59:30,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:30,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 12 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-09-05 11:59:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2019-09-05 11:59:30,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:59:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:59:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:59:30,859 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 29 states. [2019-09-05 11:59:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:31,354 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-09-05 11:59:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:59:31,355 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2019-09-05 11:59:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:31,356 INFO L225 Difference]: With dead ends: 79 [2019-09-05 11:59:31,356 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 11:59:31,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1467, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:59:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 11:59:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-09-05 11:59:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-05 11:59:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-09-05 11:59:31,373 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 63 [2019-09-05 11:59:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:31,374 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-09-05 11:59:31,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:59:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-09-05 11:59:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 11:59:31,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:31,375 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:31,375 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:31,376 INFO L82 PathProgramCache]: Analyzing trace with hash -791196975, now seen corresponding path program 13 times [2019-09-05 11:59:31,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:31,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 77 proven. 50 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 11:59:31,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:31,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:32,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:59:32,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:32,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 13 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-05 11:59:32,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 34 [2019-09-05 11:59:32,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-05 11:59:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-05 11:59:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2019-09-05 11:59:32,421 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 34 states. [2019-09-05 11:59:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:33,368 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2019-09-05 11:59:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:59:33,369 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-09-05 11:59:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:33,370 INFO L225 Difference]: With dead ends: 140 [2019-09-05 11:59:33,370 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 11:59:33,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=226, Invalid=1754, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:59:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 11:59:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2019-09-05 11:59:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 11:59:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-09-05 11:59:33,385 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 70 [2019-09-05 11:59:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:33,386 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-09-05 11:59:33,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-05 11:59:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-09-05 11:59:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-05 11:59:33,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:33,388 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:33,388 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash -760168168, now seen corresponding path program 14 times [2019-09-05 11:59:33,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:33,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:33,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:33,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 50 proven. 86 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-05 11:59:33,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:33,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:33,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:59:33,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:33,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:33,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:59:33,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 14 proven. 122 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:33,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:33,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2019-09-05 11:59:33,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:59:33,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:59:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:59:33,899 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 32 states. [2019-09-05 11:59:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:34,442 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2019-09-05 11:59:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:59:34,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-09-05 11:59:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:34,444 INFO L225 Difference]: With dead ends: 87 [2019-09-05 11:59:34,444 INFO L226 Difference]: Without dead ends: 85 [2019-09-05 11:59:34,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2019-09-05 11:59:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-05 11:59:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-09-05 11:59:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-05 11:59:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-09-05 11:59:34,452 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 71 [2019-09-05 11:59:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:34,452 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-09-05 11:59:34,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:59:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-09-05 11:59:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 11:59:34,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:34,454 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:34,454 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1796776081, now seen corresponding path program 15 times [2019-09-05 11:59:34,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:34,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:34,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 100 proven. 61 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 11:59:35,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:35,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:35,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:35,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-05 11:59:35,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:35,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:59:35,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-05 11:59:36,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:36,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 45 [2019-09-05 11:59:36,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:59:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:59:36,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:59:36,072 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 45 states. [2019-09-05 11:59:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:37,140 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2019-09-05 11:59:37,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:59:37,141 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 78 [2019-09-05 11:59:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:37,142 INFO L225 Difference]: With dead ends: 155 [2019-09-05 11:59:37,142 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 11:59:37,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=289, Invalid=2903, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:59:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 11:59:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2019-09-05 11:59:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-05 11:59:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-05 11:59:37,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 78 [2019-09-05 11:59:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:37,152 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-05 11:59:37,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:59:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-05 11:59:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-05 11:59:37,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:37,154 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:37,154 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1474666166, now seen corresponding path program 16 times [2019-09-05 11:59:37,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:37,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:37,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 61 proven. 110 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-05 11:59:37,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:37,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:37,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:59:37,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:37,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:37,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:59:37,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:37,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 15 proven. 177 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:37,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:37,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 36 [2019-09-05 11:59:37,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:59:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:59:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-09-05 11:59:37,796 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 36 states. [2019-09-05 11:59:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:38,540 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2019-09-05 11:59:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:59:38,541 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2019-09-05 11:59:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:38,542 INFO L225 Difference]: With dead ends: 95 [2019-09-05 11:59:38,542 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 11:59:38,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=542, Invalid=2538, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 11:59:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 11:59:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-09-05 11:59:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-05 11:59:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-09-05 11:59:38,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 79 [2019-09-05 11:59:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:38,551 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-09-05 11:59:38,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:59:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-09-05 11:59:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 11:59:38,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:38,553 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:38,553 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 233411601, now seen corresponding path program 17 times [2019-09-05 11:59:38,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:38,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:38,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 126 proven. 73 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 11:59:39,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:39,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:39,364 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-05 11:59:39,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:39,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:59:39,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:39,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:39,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:39,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:39,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 41 proven. 182 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-05 11:59:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 40 [2019-09-05 11:59:40,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-05 11:59:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-05 11:59:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2019-09-05 11:59:40,083 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 40 states. [2019-09-05 11:59:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:41,203 INFO L93 Difference]: Finished difference Result 170 states and 175 transitions. [2019-09-05 11:59:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:59:41,203 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 86 [2019-09-05 11:59:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:41,205 INFO L225 Difference]: With dead ends: 170 [2019-09-05 11:59:41,205 INFO L226 Difference]: Without dead ends: 98 [2019-09-05 11:59:41,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2019-09-05 11:59:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-05 11:59:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2019-09-05 11:59:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-05 11:59:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2019-09-05 11:59:41,213 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2019-09-05 11:59:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:41,214 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2019-09-05 11:59:41,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-05 11:59:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2019-09-05 11:59:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-05 11:59:41,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:41,215 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:41,215 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:41,215 INFO L82 PathProgramCache]: Analyzing trace with hash -382493608, now seen corresponding path program 18 times [2019-09-05 11:59:41,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:41,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:41,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 73 proven. 137 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 11:59:41,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:41,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:41,476 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:41,513 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 11:59:41,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:41,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:59:41,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:41,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 18 proven. 192 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-05 11:59:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2019-09-05 11:59:41,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:59:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:59:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:59:41,840 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 38 states. [2019-09-05 11:59:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:42,603 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-09-05 11:59:42,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:59:42,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 87 [2019-09-05 11:59:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:42,608 INFO L225 Difference]: With dead ends: 103 [2019-09-05 11:59:42,608 INFO L226 Difference]: Without dead ends: 101 [2019-09-05 11:59:42,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=612, Invalid=2694, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 11:59:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-05 11:59:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-09-05 11:59:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-05 11:59:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-05 11:59:42,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 87 [2019-09-05 11:59:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:42,616 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-05 11:59:42,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:59:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-05 11:59:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 11:59:42,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:42,618 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:42,618 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 567499823, now seen corresponding path program 19 times [2019-09-05 11:59:42,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:42,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:42,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 11:59:43,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:43,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:43,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:43,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:59:43,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:43,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 19 proven. 249 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-05 11:59:44,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:44,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 43 [2019-09-05 11:59:44,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-05 11:59:44,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-05 11:59:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2019-09-05 11:59:44,105 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 43 states. [2019-09-05 11:59:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:45,515 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-05 11:59:45,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:59:45,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 94 [2019-09-05 11:59:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:45,519 INFO L225 Difference]: With dead ends: 185 [2019-09-05 11:59:45,519 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 11:59:45,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=328, Invalid=2864, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:59:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 11:59:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2019-09-05 11:59:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-05 11:59:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2019-09-05 11:59:45,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 94 [2019-09-05 11:59:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:45,534 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2019-09-05 11:59:45,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-05 11:59:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2019-09-05 11:59:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-05 11:59:45,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:45,535 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:45,535 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:45,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1435512182, now seen corresponding path program 20 times [2019-09-05 11:59:45,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:45,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:45,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:45,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:45,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 86 proven. 167 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 11:59:45,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:45,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:45,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:46,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:59:46,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:46,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:59:46,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:46,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 20 proven. 233 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-05 11:59:46,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2019-09-05 11:59:46,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-05 11:59:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-05 11:59:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1360, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:59:46,394 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 41 states. [2019-09-05 11:59:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:47,279 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2019-09-05 11:59:47,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:59:47,279 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 95 [2019-09-05 11:59:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:47,281 INFO L225 Difference]: With dead ends: 111 [2019-09-05 11:59:47,281 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 11:59:47,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=721, Invalid=3185, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 11:59:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 11:59:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-09-05 11:59:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 11:59:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-09-05 11:59:47,290 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 95 [2019-09-05 11:59:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:47,290 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-09-05 11:59:47,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-05 11:59:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-09-05 11:59:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:59:47,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:47,291 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:47,291 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 214232401, now seen corresponding path program 21 times [2019-09-05 11:59:47,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:47,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:47,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:47,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 187 proven. 100 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 11:59:48,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:48,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:48,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:59:48,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-05 11:59:48,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:48,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-05 11:59:48,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:49,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:49,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:49,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:49,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 51 proven. 266 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-05 11:59:49,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:49,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 57 [2019-09-05 11:59:49,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-05 11:59:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-05 11:59:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2898, Unknown=0, NotChecked=0, Total=3192 [2019-09-05 11:59:49,461 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 57 states. [2019-09-05 11:59:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:51,472 INFO L93 Difference]: Finished difference Result 200 states and 205 transitions. [2019-09-05 11:59:51,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 11:59:51,473 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 102 [2019-09-05 11:59:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:51,474 INFO L225 Difference]: With dead ends: 200 [2019-09-05 11:59:51,474 INFO L226 Difference]: Without dead ends: 114 [2019-09-05 11:59:51,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=409, Invalid=4703, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 11:59:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-05 11:59:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-09-05 11:59:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-05 11:59:51,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-05 11:59:51,483 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 102 [2019-09-05 11:59:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:51,483 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-05 11:59:51,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-05 11:59:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-05 11:59:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-05 11:59:51,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:51,485 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:51,485 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1038383208, now seen corresponding path program 22 times [2019-09-05 11:59:51,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:51,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:51,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 100 proven. 200 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-05 11:59:51,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:51,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:59:51,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:51,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:59:51,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:51,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-05 11:59:51,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:52,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 21 proven. 309 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:59:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:52,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 45 [2019-09-05 11:59:52,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-05 11:59:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-05 11:59:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1656, Unknown=0, NotChecked=0, Total=1980 [2019-09-05 11:59:52,444 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 45 states. [2019-09-05 11:59:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:53,509 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-09-05 11:59:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:59:53,509 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 103 [2019-09-05 11:59:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:53,511 INFO L225 Difference]: With dead ends: 119 [2019-09-05 11:59:53,511 INFO L226 Difference]: Without dead ends: 117 [2019-09-05 11:59:53,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=875, Invalid=4095, Unknown=0, NotChecked=0, Total=4970 [2019-09-05 11:59:53,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-05 11:59:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2019-09-05 11:59:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-05 11:59:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-09-05 11:59:53,521 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 103 [2019-09-05 11:59:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:53,521 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-09-05 11:59:53,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-05 11:59:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-09-05 11:59:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:59:53,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:53,522 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:53,522 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:53,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1938311407, now seen corresponding path program 23 times [2019-09-05 11:59:53,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:53,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:53,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:53,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:53,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 222 proven. 115 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-05 11:59:54,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:54,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:59:54,651 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-09-05 11:59:54,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:54,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-05 11:59:54,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:55,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:55,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:55,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:55,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 56 proven. 314 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-05 11:59:55,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:55,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 49 [2019-09-05 11:59:55,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-05 11:59:55,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-05 11:59:55,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2058, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:59:55,417 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 49 states. [2019-09-05 11:59:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:57,039 INFO L93 Difference]: Finished difference Result 215 states and 220 transitions. [2019-09-05 11:59:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-05 11:59:57,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 110 [2019-09-05 11:59:57,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:57,041 INFO L225 Difference]: With dead ends: 215 [2019-09-05 11:59:57,041 INFO L226 Difference]: Without dead ends: 122 [2019-09-05 11:59:57,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=3754, Unknown=0, NotChecked=0, Total=4160 [2019-09-05 11:59:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-05 11:59:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2019-09-05 11:59:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-05 11:59:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-05 11:59:57,051 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2019-09-05 11:59:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:57,051 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-05 11:59:57,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-05 11:59:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-05 11:59:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-05 11:59:57,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:57,052 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:57,052 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:57,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1130386378, now seen corresponding path program 24 times [2019-09-05 11:59:57,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:57,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:57,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:57,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:57,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 115 proven. 236 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-05 11:59:57,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:59:57,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:59:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:59:57,456 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:59:57,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:59:57,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:59:57,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:59:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:59:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 24 proven. 327 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-05 11:59:57,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:59:57,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 47 [2019-09-05 11:59:57,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:59:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:59:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:59:57,885 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 47 states. [2019-09-05 11:59:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:58,941 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2019-09-05 11:59:58,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:59:58,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 111 [2019-09-05 11:59:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:58,943 INFO L225 Difference]: With dead ends: 127 [2019-09-05 11:59:58,944 INFO L226 Difference]: Without dead ends: 125 [2019-09-05 11:59:58,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=966, Invalid=4290, Unknown=0, NotChecked=0, Total=5256 [2019-09-05 11:59:58,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-05 11:59:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-09-05 11:59:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-05 11:59:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-09-05 11:59:58,953 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 111 [2019-09-05 11:59:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:58,954 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-09-05 11:59:58,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:59:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-09-05 11:59:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-05 11:59:58,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:58,955 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:58,955 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:58,956 INFO L82 PathProgramCache]: Analyzing trace with hash 600659601, now seen corresponding path program 25 times [2019-09-05 11:59:58,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:58,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:58,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:59:58,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 260 proven. 131 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:00:00,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:00,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:00,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:00,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:00:00,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:00,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:00,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 25 proven. 402 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:01,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:01,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 52 [2019-09-05 12:00:01,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-05 12:00:01,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-05 12:00:01,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2323, Unknown=0, NotChecked=0, Total=2652 [2019-09-05 12:00:01,076 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 52 states. [2019-09-05 12:00:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:03,005 INFO L93 Difference]: Finished difference Result 230 states and 235 transitions. [2019-09-05 12:00:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:00:03,006 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 118 [2019-09-05 12:00:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:03,008 INFO L225 Difference]: With dead ends: 230 [2019-09-05 12:00:03,008 INFO L226 Difference]: Without dead ends: 130 [2019-09-05 12:00:03,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=448, Invalid=4244, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:00:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-05 12:00:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2019-09-05 12:00:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-05 12:00:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2019-09-05 12:00:03,024 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 118 [2019-09-05 12:00:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:03,025 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2019-09-05 12:00:03,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-05 12:00:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2019-09-05 12:00:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-05 12:00:03,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:03,026 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:03,026 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:03,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash -70483240, now seen corresponding path program 26 times [2019-09-05 12:00:03,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:03,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:03,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 131 proven. 275 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:00:03,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:03,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:03,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:03,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:03,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:03,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 12:00:03,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-05 12:00:04,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:04,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 50 [2019-09-05 12:00:04,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-05 12:00:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-05 12:00:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=2035, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 12:00:04,366 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 50 states. [2019-09-05 12:00:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:05,609 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2019-09-05 12:00:05,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-05 12:00:05,610 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 119 [2019-09-05 12:00:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:05,611 INFO L225 Difference]: With dead ends: 135 [2019-09-05 12:00:05,611 INFO L226 Difference]: Without dead ends: 133 [2019-09-05 12:00:05,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1102, Invalid=4904, Unknown=0, NotChecked=0, Total=6006 [2019-09-05 12:00:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-05 12:00:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-09-05 12:00:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-05 12:00:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-09-05 12:00:05,622 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2019-09-05 12:00:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:05,622 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-09-05 12:00:05,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-05 12:00:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-09-05 12:00:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-05 12:00:05,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:05,623 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:05,623 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1289607761, now seen corresponding path program 27 times [2019-09-05 12:00:05,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:05,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 301 proven. 148 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-05 12:00:07,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:07,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:07,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-05 12:00:07,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:07,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-05 12:00:07,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:08,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:08,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:08,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:08,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 66 proven. 422 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-05 12:00:08,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 69 [2019-09-05 12:00:08,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-05 12:00:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-05 12:00:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4284, Unknown=0, NotChecked=0, Total=4692 [2019-09-05 12:00:08,928 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 69 states. [2019-09-05 12:00:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:11,696 INFO L93 Difference]: Finished difference Result 245 states and 250 transitions. [2019-09-05 12:00:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 12:00:11,697 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 126 [2019-09-05 12:00:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:11,699 INFO L225 Difference]: With dead ends: 245 [2019-09-05 12:00:11,699 INFO L226 Difference]: Without dead ends: 138 [2019-09-05 12:00:11,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=547, Invalid=6935, Unknown=0, NotChecked=0, Total=7482 [2019-09-05 12:00:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-05 12:00:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2019-09-05 12:00:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-05 12:00:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-05 12:00:11,713 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 126 [2019-09-05 12:00:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:11,714 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-05 12:00:11,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-05 12:00:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-05 12:00:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-05 12:00:11,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:11,716 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:11,716 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -30401802, now seen corresponding path program 28 times [2019-09-05 12:00:11,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:11,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:11,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:11,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:11,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 148 proven. 317 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-05 12:00:12,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:12,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:12,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:12,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:12,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:12,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 12:00:12,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:12,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 27 proven. 477 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-05 12:00:12,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:12,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 54 [2019-09-05 12:00:12,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-05 12:00:12,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-05 12:00:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 12:00:12,963 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 54 states. [2019-09-05 12:00:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:14,543 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-09-05 12:00:14,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 12:00:14,543 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 127 [2019-09-05 12:00:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:14,545 INFO L225 Difference]: With dead ends: 143 [2019-09-05 12:00:14,545 INFO L226 Difference]: Without dead ends: 141 [2019-09-05 12:00:14,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1289, Invalid=6021, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:00:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-05 12:00:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2019-09-05 12:00:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-05 12:00:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-09-05 12:00:14,556 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 127 [2019-09-05 12:00:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:14,557 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-09-05 12:00:14,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-05 12:00:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-09-05 12:00:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-05 12:00:14,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:14,558 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:14,558 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:14,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:14,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1436102703, now seen corresponding path program 29 times [2019-09-05 12:00:14,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:14,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:14,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:14,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 345 proven. 166 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:00:16,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:16,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:16,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-05 12:00:16,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:16,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:00:16,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:16,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:16,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:16,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:17,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 71 proven. 482 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-05 12:00:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:17,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 58 [2019-09-05 12:00:17,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-05 12:00:17,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-05 12:00:17,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2901, Unknown=0, NotChecked=0, Total=3306 [2019-09-05 12:00:17,217 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 58 states. [2019-09-05 12:00:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:19,290 INFO L93 Difference]: Finished difference Result 260 states and 265 transitions. [2019-09-05 12:00:19,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-05 12:00:19,291 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 134 [2019-09-05 12:00:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:19,292 INFO L225 Difference]: With dead ends: 260 [2019-09-05 12:00:19,292 INFO L226 Difference]: Without dead ends: 146 [2019-09-05 12:00:19,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=538, Invalid=5314, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:00:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-05 12:00:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2019-09-05 12:00:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-05 12:00:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2019-09-05 12:00:19,305 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2019-09-05 12:00:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:19,305 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2019-09-05 12:00:19,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-05 12:00:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2019-09-05 12:00:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-05 12:00:19,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:19,306 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:19,306 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash 900369944, now seen corresponding path program 30 times [2019-09-05 12:00:19,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:19,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:19,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:19,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 166 proven. 362 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:00:19,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:19,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:19,785 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:19,846 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-05 12:00:19,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:19,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 12:00:19,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:20,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 30 proven. 498 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-05 12:00:20,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:20,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 56 [2019-09-05 12:00:20,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-05 12:00:20,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-05 12:00:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2019-09-05 12:00:20,492 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 56 states. [2019-09-05 12:00:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:22,034 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2019-09-05 12:00:22,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-05 12:00:22,034 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 135 [2019-09-05 12:00:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:22,036 INFO L225 Difference]: With dead ends: 151 [2019-09-05 12:00:22,036 INFO L226 Difference]: Without dead ends: 149 [2019-09-05 12:00:22,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1401, Invalid=6255, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:00:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-05 12:00:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-09-05 12:00:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-05 12:00:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-05 12:00:22,048 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 135 [2019-09-05 12:00:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:22,048 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-05 12:00:22,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-05 12:00:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-05 12:00:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-05 12:00:22,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:22,050 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:22,050 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -390270353, now seen corresponding path program 31 times [2019-09-05 12:00:22,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:22,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:22,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 392 proven. 185 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 12:00:23,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:23,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:23,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:23,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-05 12:00:23,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:24,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:24,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 31 proven. 591 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-05 12:00:24,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:24,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42] total 61 [2019-09-05 12:00:24,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-05 12:00:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-05 12:00:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=3214, Unknown=0, NotChecked=0, Total=3660 [2019-09-05 12:00:24,848 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 61 states. [2019-09-05 12:00:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:26,978 INFO L93 Difference]: Finished difference Result 275 states and 280 transitions. [2019-09-05 12:00:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-05 12:00:26,979 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 142 [2019-09-05 12:00:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:26,981 INFO L225 Difference]: With dead ends: 275 [2019-09-05 12:00:26,981 INFO L226 Difference]: Without dead ends: 154 [2019-09-05 12:00:26,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=586, Invalid=5894, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:00:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-05 12:00:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-09-05 12:00:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-05 12:00:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2019-09-05 12:00:26,994 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 142 [2019-09-05 12:00:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:26,994 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2019-09-05 12:00:26,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-05 12:00:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2019-09-05 12:00:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-05 12:00:26,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:26,996 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:26,996 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1784510902, now seen corresponding path program 32 times [2019-09-05 12:00:26,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 185 proven. 410 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-05 12:00:27,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:27,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:27,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:27,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:27,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-05 12:00:27,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:28,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 32 proven. 563 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:00:28,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:28,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 59 [2019-09-05 12:00:28,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-05 12:00:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-05 12:00:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=2845, Unknown=0, NotChecked=0, Total=3422 [2019-09-05 12:00:28,255 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 59 states. [2019-09-05 12:00:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:29,976 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2019-09-05 12:00:29,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-05 12:00:29,977 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 143 [2019-09-05 12:00:29,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:29,979 INFO L225 Difference]: With dead ends: 159 [2019-09-05 12:00:29,979 INFO L226 Difference]: Without dead ends: 157 [2019-09-05 12:00:29,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1564, Invalid=6992, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:00:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-05 12:00:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-09-05 12:00:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-05 12:00:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-09-05 12:00:29,992 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 143 [2019-09-05 12:00:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:29,992 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-09-05 12:00:29,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-05 12:00:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-09-05 12:00:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-05 12:00:29,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:29,993 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:29,993 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 955603217, now seen corresponding path program 33 times [2019-09-05 12:00:29,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:29,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:29,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 442 proven. 205 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-05 12:00:31,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:31,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:31,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:00:31,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-05 12:00:31,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:31,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 12:00:31,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:33,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:33,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:33,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:33,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 81 proven. 614 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-05 12:00:33,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:33,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 81 [2019-09-05 12:00:33,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 12:00:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 12:00:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=5940, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:00:33,909 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 81 states. [2019-09-05 12:00:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:37,399 INFO L93 Difference]: Finished difference Result 290 states and 295 transitions. [2019-09-05 12:00:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 12:00:37,400 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 150 [2019-09-05 12:00:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:37,402 INFO L225 Difference]: With dead ends: 290 [2019-09-05 12:00:37,402 INFO L226 Difference]: Without dead ends: 162 [2019-09-05 12:00:37,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2571 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=703, Invalid=9599, Unknown=0, NotChecked=0, Total=10302 [2019-09-05 12:00:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-05 12:00:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2019-09-05 12:00:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-05 12:00:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-05 12:00:37,416 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 150 [2019-09-05 12:00:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:37,416 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-05 12:00:37,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 12:00:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-05 12:00:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-05 12:00:37,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:37,418 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:37,418 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1343859032, now seen corresponding path program 34 times [2019-09-05 12:00:37,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:37,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:37,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:37,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:37,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 205 proven. 461 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-09-05 12:00:38,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:38,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:38,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:00:38,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:00:38,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 12:00:38,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:38,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 33 proven. 681 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-09-05 12:00:38,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 43] total 63 [2019-09-05 12:00:38,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-05 12:00:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-05 12:00:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=3267, Unknown=0, NotChecked=0, Total=3906 [2019-09-05 12:00:38,949 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 63 states. [2019-09-05 12:00:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:41,076 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2019-09-05 12:00:41,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-05 12:00:41,076 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 151 [2019-09-05 12:00:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:41,078 INFO L225 Difference]: With dead ends: 167 [2019-09-05 12:00:41,079 INFO L226 Difference]: Without dead ends: 165 [2019-09-05 12:00:41,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1784, Invalid=8316, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:00:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-05 12:00:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-09-05 12:00:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-05 12:00:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-09-05 12:00:41,090 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 151 [2019-09-05 12:00:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:41,091 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-09-05 12:00:41,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-05 12:00:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-09-05 12:00:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-05 12:00:41,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:41,092 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:41,092 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1149980881, now seen corresponding path program 35 times [2019-09-05 12:00:41,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:41,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:41,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:41,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:41,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 495 proven. 226 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-05 12:00:43,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:43,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:43,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:00:43,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-05 12:00:43,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:43,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-05 12:00:43,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:44,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:44,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:44,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 86 proven. 686 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-05 12:00:44,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:44,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 67 [2019-09-05 12:00:44,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-05 12:00:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-05 12:00:44,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=3888, Unknown=0, NotChecked=0, Total=4422 [2019-09-05 12:00:44,927 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 67 states. [2019-09-05 12:00:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:47,460 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2019-09-05 12:00:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-05 12:00:47,460 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 158 [2019-09-05 12:00:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:47,462 INFO L225 Difference]: With dead ends: 305 [2019-09-05 12:00:47,462 INFO L226 Difference]: Without dead ends: 170 [2019-09-05 12:00:47,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=688, Invalid=7144, Unknown=0, NotChecked=0, Total=7832 [2019-09-05 12:00:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-05 12:00:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2019-09-05 12:00:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-05 12:00:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2019-09-05 12:00:47,474 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2019-09-05 12:00:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:47,474 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2019-09-05 12:00:47,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-05 12:00:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2019-09-05 12:00:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-05 12:00:47,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:47,475 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:47,475 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:47,475 INFO L82 PathProgramCache]: Analyzing trace with hash -263993226, now seen corresponding path program 36 times [2019-09-05 12:00:47,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:47,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:47,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 226 proven. 515 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-09-05 12:00:48,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:48,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:00:48,171 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 12:00:48,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:48,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 12:00:48,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:48,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 44 proven. 748 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-05 12:00:49,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:49,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 45] total 66 [2019-09-05 12:00:49,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-05 12:00:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-05 12:00:49,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=3588, Unknown=0, NotChecked=0, Total=4290 [2019-09-05 12:00:49,009 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 66 states. [2019-09-05 12:00:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:51,163 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2019-09-05 12:00:51,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-05 12:00:51,163 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 159 [2019-09-05 12:00:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:51,165 INFO L225 Difference]: With dead ends: 175 [2019-09-05 12:00:51,165 INFO L226 Difference]: Without dead ends: 173 [2019-09-05 12:00:51,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1967, Invalid=9163, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:00:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-05 12:00:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2019-09-05 12:00:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-05 12:00:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-09-05 12:00:51,177 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 159 [2019-09-05 12:00:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:51,177 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-09-05 12:00:51,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-05 12:00:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-09-05 12:00:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-05 12:00:51,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:51,178 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:51,179 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash -388173231, now seen corresponding path program 37 times [2019-09-05 12:00:51,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:51,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:51,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:00:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 551 proven. 248 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-05 12:00:53,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:53,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:53,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:53,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 12:00:53,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:00:54,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:54,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:54,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:54,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:00:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 37 proven. 816 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-09-05 12:00:54,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:00:54,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 70 [2019-09-05 12:00:54,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-05 12:00:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-05 12:00:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4249, Unknown=0, NotChecked=0, Total=4830 [2019-09-05 12:00:54,857 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 70 states. [2019-09-05 12:00:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:00:58,102 INFO L93 Difference]: Finished difference Result 320 states and 325 transitions. [2019-09-05 12:00:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 12:00:58,102 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-09-05 12:00:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:00:58,104 INFO L225 Difference]: With dead ends: 320 [2019-09-05 12:00:58,104 INFO L226 Difference]: Without dead ends: 178 [2019-09-05 12:00:58,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=742, Invalid=7814, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:00:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-05 12:00:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2019-09-05 12:00:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-05 12:00:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2019-09-05 12:00:58,117 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 166 [2019-09-05 12:00:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:00:58,117 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2019-09-05 12:00:58,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-05 12:00:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2019-09-05 12:00:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-05 12:00:58,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:00:58,118 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:00:58,118 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:00:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:00:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1401039720, now seen corresponding path program 38 times [2019-09-05 12:00:58,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:00:58,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:00:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:00:58,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:00:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:00:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 248 proven. 572 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-05 12:00:58,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:00:58,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:00:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:00:59,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:00:59,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:00:59,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-05 12:00:59,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:00,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 38 proven. 782 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-05 12:01:00,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:00,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 68 [2019-09-05 12:01:00,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-05 12:01:00,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-05 12:01:00,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=3790, Unknown=0, NotChecked=0, Total=4556 [2019-09-05 12:01:00,243 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 68 states. [2019-09-05 12:01:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:02,386 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2019-09-05 12:01:02,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 12:01:02,386 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 167 [2019-09-05 12:01:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:02,387 INFO L225 Difference]: With dead ends: 183 [2019-09-05 12:01:02,387 INFO L226 Difference]: Without dead ends: 181 [2019-09-05 12:01:02,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2107, Invalid=9449, Unknown=0, NotChecked=0, Total=11556 [2019-09-05 12:01:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-05 12:01:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2019-09-05 12:01:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-05 12:01:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-09-05 12:01:02,402 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 167 [2019-09-05 12:01:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:02,402 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-09-05 12:01:02,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-05 12:01:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-09-05 12:01:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-05 12:01:02,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:02,403 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:02,404 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash 828726255, now seen corresponding path program 39 times [2019-09-05 12:01:02,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:02,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 610 proven. 271 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-05 12:01:04,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:04,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:04,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:04,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-05 12:01:04,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:04,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-05 12:01:04,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:07,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:07,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:07,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 39 proven. 899 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-05 12:01:07,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:07,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 93 [2019-09-05 12:01:07,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-05 12:01:07,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-05 12:01:07,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=7866, Unknown=0, NotChecked=0, Total=8556 [2019-09-05 12:01:07,380 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 93 states. [2019-09-05 12:01:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:12,050 INFO L93 Difference]: Finished difference Result 335 states and 340 transitions. [2019-09-05 12:01:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 12:01:12,051 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 174 [2019-09-05 12:01:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:12,053 INFO L225 Difference]: With dead ends: 335 [2019-09-05 12:01:12,053 INFO L226 Difference]: Without dead ends: 186 [2019-09-05 12:01:12,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3408 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=877, Invalid=12695, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:01:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-05 12:01:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2019-09-05 12:01:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-05 12:01:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-05 12:01:12,069 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 174 [2019-09-05 12:01:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:12,069 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-05 12:01:12,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-05 12:01:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-05 12:01:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-05 12:01:12,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:12,071 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:12,071 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:12,072 INFO L82 PathProgramCache]: Analyzing trace with hash -570489034, now seen corresponding path program 40 times [2019-09-05 12:01:12,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:12,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:12,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:12,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 271 proven. 632 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-05 12:01:12,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:12,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:12,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:12,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:12,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:12,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-05 12:01:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 39 proven. 921 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-09-05 12:01:13,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:13,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 49] total 72 [2019-09-05 12:01:13,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-05 12:01:13,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-05 12:01:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=4275, Unknown=0, NotChecked=0, Total=5112 [2019-09-05 12:01:13,986 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 72 states. [2019-09-05 12:01:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:16,671 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2019-09-05 12:01:16,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-05 12:01:16,671 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 175 [2019-09-05 12:01:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:16,673 INFO L225 Difference]: With dead ends: 191 [2019-09-05 12:01:16,673 INFO L226 Difference]: Without dead ends: 189 [2019-09-05 12:01:16,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3344 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2360, Invalid=10980, Unknown=0, NotChecked=0, Total=13340 [2019-09-05 12:01:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-05 12:01:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-09-05 12:01:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-05 12:01:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-09-05 12:01:16,701 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 175 [2019-09-05 12:01:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:16,701 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-09-05 12:01:16,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-05 12:01:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-09-05 12:01:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-05 12:01:16,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:16,703 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:16,703 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1803445359, now seen corresponding path program 41 times [2019-09-05 12:01:16,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:16,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:16,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:16,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 672 proven. 295 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-05 12:01:19,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:19,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:19,584 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:01:19,660 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-05 12:01:19,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:19,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-05 12:01:19,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:21,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:21,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:21,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:21,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 101 proven. 926 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-05 12:01:21,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:21,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52] total 76 [2019-09-05 12:01:21,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-05 12:01:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-05 12:01:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=681, Invalid=5019, Unknown=0, NotChecked=0, Total=5700 [2019-09-05 12:01:21,409 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 76 states. [2019-09-05 12:01:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:25,058 INFO L93 Difference]: Finished difference Result 350 states and 355 transitions. [2019-09-05 12:01:25,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-05 12:01:25,058 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 182 [2019-09-05 12:01:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:25,060 INFO L225 Difference]: With dead ends: 350 [2019-09-05 12:01:25,060 INFO L226 Difference]: Without dead ends: 194 [2019-09-05 12:01:25,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=856, Invalid=9244, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:01:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-05 12:01:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2019-09-05 12:01:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-05 12:01:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2019-09-05 12:01:25,076 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 182 [2019-09-05 12:01:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:25,077 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2019-09-05 12:01:25,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-05 12:01:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2019-09-05 12:01:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-05 12:01:25,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:25,078 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:25,078 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:25,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1832587224, now seen corresponding path program 42 times [2019-09-05 12:01:25,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:25,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:25,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:25,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:25,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 295 proven. 695 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-05 12:01:26,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:26,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:26,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:01:26,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-09-05 12:01:26,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:26,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-05 12:01:26,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:27,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 42 proven. 948 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-09-05 12:01:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:27,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 74 [2019-09-05 12:01:27,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-05 12:01:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-05 12:01:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=4495, Unknown=0, NotChecked=0, Total=5402 [2019-09-05 12:01:27,599 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 74 states. [2019-09-05 12:01:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:30,140 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2019-09-05 12:01:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-05 12:01:30,141 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 183 [2019-09-05 12:01:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:30,142 INFO L225 Difference]: With dead ends: 199 [2019-09-05 12:01:30,143 INFO L226 Difference]: Without dead ends: 197 [2019-09-05 12:01:30,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3335 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2514, Invalid=11292, Unknown=0, NotChecked=0, Total=13806 [2019-09-05 12:01:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-05 12:01:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2019-09-05 12:01:30,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-05 12:01:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-09-05 12:01:30,158 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 183 [2019-09-05 12:01:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:30,159 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-09-05 12:01:30,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-05 12:01:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-09-05 12:01:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-05 12:01:30,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:30,160 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:30,160 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1873475759, now seen corresponding path program 43 times [2019-09-05 12:01:30,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:30,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:30,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:30,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 737 proven. 320 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-05 12:01:32,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:32,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:32,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-05 12:01:33,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:34,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:34,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:34,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 43 proven. 1077 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-05 12:01:34,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:34,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 54] total 79 [2019-09-05 12:01:34,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-05 12:01:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-05 12:01:34,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=5428, Unknown=0, NotChecked=0, Total=6162 [2019-09-05 12:01:34,800 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 79 states. [2019-09-05 12:01:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:38,257 INFO L93 Difference]: Finished difference Result 365 states and 370 transitions. [2019-09-05 12:01:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:01:38,258 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 190 [2019-09-05 12:01:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:38,260 INFO L225 Difference]: With dead ends: 365 [2019-09-05 12:01:38,260 INFO L226 Difference]: Without dead ends: 202 [2019-09-05 12:01:38,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=916, Invalid=10004, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:01:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-05 12:01:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-09-05 12:01:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-05 12:01:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2019-09-05 12:01:38,277 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 190 [2019-09-05 12:01:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:38,277 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2019-09-05 12:01:38,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-05 12:01:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2019-09-05 12:01:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-05 12:01:38,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:38,278 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:38,279 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1599392266, now seen corresponding path program 44 times [2019-09-05 12:01:38,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:38,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:01:38,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 320 proven. 761 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-05 12:01:39,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:39,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:39,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:01:39,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:01:39,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:39,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-05 12:01:39,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:40,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 44 proven. 1037 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-09-05 12:01:40,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:40,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 77 [2019-09-05 12:01:40,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-05 12:01:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-05 12:01:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=982, Invalid=4870, Unknown=0, NotChecked=0, Total=5852 [2019-09-05 12:01:40,357 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 77 states. [2019-09-05 12:01:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:42,925 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2019-09-05 12:01:42,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-05 12:01:42,926 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 191 [2019-09-05 12:01:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:42,927 INFO L225 Difference]: With dead ends: 207 [2019-09-05 12:01:42,927 INFO L226 Difference]: Without dead ends: 205 [2019-09-05 12:01:42,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2731, Invalid=12275, Unknown=0, NotChecked=0, Total=15006 [2019-09-05 12:01:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-05 12:01:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2019-09-05 12:01:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-05 12:01:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-09-05 12:01:42,945 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 191 [2019-09-05 12:01:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:42,945 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-09-05 12:01:42,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-05 12:01:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-09-05 12:01:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-05 12:01:42,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:42,947 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:42,947 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash 390550737, now seen corresponding path program 45 times [2019-09-05 12:01:42,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:42,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:42,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:42,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:42,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 805 proven. 346 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-05 12:01:45,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:45,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:45,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:01:45,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-05 12:01:45,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:45,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-05 12:01:45,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:48,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:48,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:48,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 111 proven. 1106 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-05 12:01:49,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:49,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56] total 105 [2019-09-05 12:01:49,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-05 12:01:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-05 12:01:49,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=858, Invalid=10062, Unknown=0, NotChecked=0, Total=10920 [2019-09-05 12:01:49,111 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 105 states. [2019-09-05 12:01:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:52,898 INFO L93 Difference]: Finished difference Result 380 states and 385 transitions. [2019-09-05 12:01:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 12:01:52,899 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 198 [2019-09-05 12:01:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:52,901 INFO L225 Difference]: With dead ends: 380 [2019-09-05 12:01:52,901 INFO L226 Difference]: Without dead ends: 210 [2019-09-05 12:01:52,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4362 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1069, Invalid=16223, Unknown=0, NotChecked=0, Total=17292 [2019-09-05 12:01:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-05 12:01:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2019-09-05 12:01:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-05 12:01:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2019-09-05 12:01:52,919 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 198 [2019-09-05 12:01:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:52,920 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2019-09-05 12:01:52,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-05 12:01:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2019-09-05 12:01:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-05 12:01:52,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:52,921 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:52,921 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1246405864, now seen corresponding path program 46 times [2019-09-05 12:01:52,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:52,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:01:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 346 proven. 830 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-09-05 12:01:53,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:01:53,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:01:53,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:01:53,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:01:53,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:01:53,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-05 12:01:53,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:01:55,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:01:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2188 backedges. 45 proven. 1197 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-09-05 12:01:55,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:01:55,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 55] total 81 [2019-09-05 12:01:55,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-05 12:01:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-05 12:01:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1062, Invalid=5418, Unknown=0, NotChecked=0, Total=6480 [2019-09-05 12:01:55,214 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 81 states. [2019-09-05 12:01:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:01:58,146 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2019-09-05 12:01:58,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-05 12:01:58,146 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 199 [2019-09-05 12:01:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:01:58,148 INFO L225 Difference]: With dead ends: 215 [2019-09-05 12:01:58,148 INFO L226 Difference]: Without dead ends: 213 [2019-09-05 12:01:58,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4289 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3017, Invalid=14013, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:01:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-05 12:01:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2019-09-05 12:01:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-05 12:01:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-09-05 12:01:58,167 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 199 [2019-09-05 12:01:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:01:58,168 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-09-05 12:01:58,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-05 12:01:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-09-05 12:01:58,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-05 12:01:58,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:01:58,169 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:01:58,169 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:01:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:01:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2053211503, now seen corresponding path program 47 times [2019-09-05 12:01:58,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:01:58,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:01:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:58,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:01:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:01:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 876 proven. 373 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-05 12:02:00,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:00,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:00,994 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-09-05 12:02:00,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:00,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-05 12:02:01,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:02,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:02,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:02,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 116 proven. 1202 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-09-05 12:02:03,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:03,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 58] total 85 [2019-09-05 12:02:03,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-05 12:02:03,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-05 12:02:03,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=6294, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 12:02:03,060 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 85 states. [2019-09-05 12:02:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:07,005 INFO L93 Difference]: Finished difference Result 395 states and 400 transitions. [2019-09-05 12:02:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-05 12:02:07,006 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 206 [2019-09-05 12:02:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:07,008 INFO L225 Difference]: With dead ends: 395 [2019-09-05 12:02:07,009 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 12:02:07,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1042, Invalid=11614, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:02:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 12:02:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2019-09-05 12:02:07,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-05 12:02:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2019-09-05 12:02:07,027 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 206 [2019-09-05 12:02:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:07,028 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2019-09-05 12:02:07,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-05 12:02:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2019-09-05 12:02:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-05 12:02:07,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:07,029 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:07,029 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:07,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2073799498, now seen corresponding path program 48 times [2019-09-05 12:02:07,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:07,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:07,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 373 proven. 902 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-05 12:02:08,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:08,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:08,011 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:02:08,096 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 12:02:08,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:08,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-05 12:02:08,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 48 proven. 1227 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-05 12:02:09,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:09,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 83 [2019-09-05 12:02:09,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-05 12:02:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-05 12:02:09,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1141, Invalid=5665, Unknown=0, NotChecked=0, Total=6806 [2019-09-05 12:02:09,498 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 83 states. [2019-09-05 12:02:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:12,618 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2019-09-05 12:02:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-05 12:02:12,618 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 207 [2019-09-05 12:02:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:12,620 INFO L225 Difference]: With dead ends: 223 [2019-09-05 12:02:12,621 INFO L226 Difference]: Without dead ends: 221 [2019-09-05 12:02:12,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3192, Invalid=14364, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:02:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-05 12:02:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2019-09-05 12:02:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-05 12:02:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2019-09-05 12:02:12,639 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 207 [2019-09-05 12:02:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:12,639 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2019-09-05 12:02:12,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-05 12:02:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2019-09-05 12:02:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-05 12:02:12,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:12,641 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:12,641 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1919803887, now seen corresponding path program 49 times [2019-09-05 12:02:12,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:12,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:12,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 950 proven. 401 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-05 12:02:15,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:15,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:15,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-05 12:02:15,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:17,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:17,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 49 proven. 1374 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-09-05 12:02:18,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:18,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 60] total 88 [2019-09-05 12:02:18,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-05 12:02:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-05 12:02:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=6751, Unknown=0, NotChecked=0, Total=7656 [2019-09-05 12:02:18,031 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 88 states. [2019-09-05 12:02:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:22,638 INFO L93 Difference]: Finished difference Result 410 states and 415 transitions. [2019-09-05 12:02:22,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:02:22,638 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 214 [2019-09-05 12:02:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:22,640 INFO L225 Difference]: With dead ends: 410 [2019-09-05 12:02:22,640 INFO L226 Difference]: Without dead ends: 226 [2019-09-05 12:02:22,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1108, Invalid=12464, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:02:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-05 12:02:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2019-09-05 12:02:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-05 12:02:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2019-09-05 12:02:22,659 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 214 [2019-09-05 12:02:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:22,659 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2019-09-05 12:02:22,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-05 12:02:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2019-09-05 12:02:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-05 12:02:22,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:22,661 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:22,661 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash -363809192, now seen corresponding path program 50 times [2019-09-05 12:02:22,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:22,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:02:22,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 401 proven. 977 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-05 12:02:23,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:23,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:02:23,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:23,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:02:23,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:23,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-05 12:02:23,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:25,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 50 proven. 1328 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-09-05 12:02:25,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:25,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 86 [2019-09-05 12:02:25,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-05 12:02:25,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-05 12:02:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=6085, Unknown=0, NotChecked=0, Total=7310 [2019-09-05 12:02:25,214 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 86 states. [2019-09-05 12:02:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:28,303 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2019-09-05 12:02:28,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 12:02:28,304 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 215 [2019-09-05 12:02:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:28,305 INFO L225 Difference]: With dead ends: 231 [2019-09-05 12:02:28,306 INFO L226 Difference]: Without dead ends: 229 [2019-09-05 12:02:28,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4617 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3436, Invalid=15470, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:02:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-05 12:02:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-09-05 12:02:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-05 12:02:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2019-09-05 12:02:28,325 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 215 [2019-09-05 12:02:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:28,325 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2019-09-05 12:02:28,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-05 12:02:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2019-09-05 12:02:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-05 12:02:28,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:28,327 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:28,327 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash -190512593, now seen corresponding path program 51 times [2019-09-05 12:02:28,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:28,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:28,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 1027 proven. 430 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-05 12:02:31,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:31,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:02:31,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:31,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-05 12:02:31,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:31,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-05 12:02:31,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2757 backedges. 126 proven. 1406 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:35,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:35,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 62] total 117 [2019-09-05 12:02:35,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-05 12:02:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-05 12:02:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1044, Invalid=12528, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:02:35,938 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 117 states. [2019-09-05 12:02:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:43,853 INFO L93 Difference]: Finished difference Result 425 states and 430 transitions. [2019-09-05 12:02:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 12:02:43,853 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 222 [2019-09-05 12:02:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:43,855 INFO L225 Difference]: With dead ends: 425 [2019-09-05 12:02:43,855 INFO L226 Difference]: Without dead ends: 234 [2019-09-05 12:02:43,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 164 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5433 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1279, Invalid=20183, Unknown=0, NotChecked=0, Total=21462 [2019-09-05 12:02:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-05 12:02:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2019-09-05 12:02:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-05 12:02:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2019-09-05 12:02:43,876 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 222 [2019-09-05 12:02:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:43,876 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2019-09-05 12:02:43,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-05 12:02:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2019-09-05 12:02:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-05 12:02:43,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:43,878 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:43,878 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:43,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:43,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1950770038, now seen corresponding path program 52 times [2019-09-05 12:02:43,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:43,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:43,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 430 proven. 1055 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-09-05 12:02:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:45,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:45,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:02:45,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:02:45,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:45,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-05 12:02:45,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2785 backedges. 51 proven. 1509 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-05 12:02:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 61] total 90 [2019-09-05 12:02:46,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-05 12:02:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-05 12:02:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=6696, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 12:02:46,774 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 90 states. [2019-09-05 12:02:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:02:50,336 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2019-09-05 12:02:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-05 12:02:50,336 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 223 [2019-09-05 12:02:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:02:50,338 INFO L225 Difference]: With dead ends: 239 [2019-09-05 12:02:50,338 INFO L226 Difference]: Without dead ends: 237 [2019-09-05 12:02:50,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3755, Invalid=17415, Unknown=0, NotChecked=0, Total=21170 [2019-09-05 12:02:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-05 12:02:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 233. [2019-09-05 12:02:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-05 12:02:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2019-09-05 12:02:50,359 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 223 [2019-09-05 12:02:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:02:50,360 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2019-09-05 12:02:50,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-05 12:02:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2019-09-05 12:02:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-05 12:02:50,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:02:50,361 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:02:50,361 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:02:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:02:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1798965423, now seen corresponding path program 53 times [2019-09-05 12:02:50,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:02:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:02:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:50,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:02:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:02:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:02:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 1107 proven. 460 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-05 12:02:53,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:02:53,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:02:53,710 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:02:53,827 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-05 12:02:53,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:02:53,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-05 12:02:53,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:02:56,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:56,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:56,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:56,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:02:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 131 proven. 1514 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-09-05 12:02:56,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:02:56,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 64] total 94 [2019-09-05 12:02:56,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-05 12:02:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-05 12:02:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1029, Invalid=7713, Unknown=0, NotChecked=0, Total=8742 [2019-09-05 12:02:56,433 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 94 states. [2019-09-05 12:03:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:01,117 INFO L93 Difference]: Finished difference Result 440 states and 445 transitions. [2019-09-05 12:03:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 12:03:01,118 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 230 [2019-09-05 12:03:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:01,119 INFO L225 Difference]: With dead ends: 440 [2019-09-05 12:03:01,120 INFO L226 Difference]: Without dead ends: 242 [2019-09-05 12:03:01,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2952 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1246, Invalid=14254, Unknown=0, NotChecked=0, Total=15500 [2019-09-05 12:03:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-05 12:03:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 234. [2019-09-05 12:03:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-05 12:03:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2019-09-05 12:03:01,141 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 230 [2019-09-05 12:03:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:01,141 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2019-09-05 12:03:01,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-05 12:03:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2019-09-05 12:03:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-05 12:03:01,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:01,143 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:01,143 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash -261021288, now seen corresponding path program 54 times [2019-09-05 12:03:01,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:01,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:01,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 460 proven. 1136 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-05 12:03:02,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:02,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:03:02,428 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-05 12:03:02,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:02,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-05 12:03:02,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:03,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 54 proven. 1542 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-09-05 12:03:04,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:04,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 92 [2019-09-05 12:03:04,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-05 12:03:04,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-05 12:03:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=6970, Unknown=0, NotChecked=0, Total=8372 [2019-09-05 12:03:04,038 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 92 states. [2019-09-05 12:03:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:07,696 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2019-09-05 12:03:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-05 12:03:07,697 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 231 [2019-09-05 12:03:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:07,698 INFO L225 Difference]: With dead ends: 247 [2019-09-05 12:03:07,699 INFO L226 Difference]: Without dead ends: 245 [2019-09-05 12:03:07,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5336 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3951, Invalid=17805, Unknown=0, NotChecked=0, Total=21756 [2019-09-05 12:03:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-05 12:03:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2019-09-05 12:03:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-05 12:03:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2019-09-05 12:03:07,721 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 231 [2019-09-05 12:03:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:07,721 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2019-09-05 12:03:07,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-05 12:03:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2019-09-05 12:03:07,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-05 12:03:07,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:07,723 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:07,723 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash -527339793, now seen corresponding path program 55 times [2019-09-05 12:03:07,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:07,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:07,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 1190 proven. 491 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-05 12:03:11,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:11,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:11,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-05 12:03:11,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3193 backedges. 55 proven. 1707 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-09-05 12:03:14,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66] total 97 [2019-09-05 12:03:14,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-05 12:03:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-05 12:03:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1094, Invalid=8218, Unknown=0, NotChecked=0, Total=9312 [2019-09-05 12:03:14,314 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 97 states. [2019-09-05 12:03:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:19,696 INFO L93 Difference]: Finished difference Result 455 states and 460 transitions. [2019-09-05 12:03:19,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:03:19,696 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 238 [2019-09-05 12:03:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:19,698 INFO L225 Difference]: With dead ends: 455 [2019-09-05 12:03:19,698 INFO L226 Difference]: Without dead ends: 250 [2019-09-05 12:03:19,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3144 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1318, Invalid=15194, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:03:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-05 12:03:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2019-09-05 12:03:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-05 12:03:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 243 transitions. [2019-09-05 12:03:19,719 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 243 transitions. Word has length 238 [2019-09-05 12:03:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:19,720 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 243 transitions. [2019-09-05 12:03:19,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-05 12:03:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 243 transitions. [2019-09-05 12:03:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-05 12:03:19,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:19,722 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:19,722 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1167236554, now seen corresponding path program 56 times [2019-09-05 12:03:19,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:03:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 491 proven. 1220 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-05 12:03:21,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:21,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:21,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:03:21,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:03:21,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:21,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-05 12:03:21,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:22,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 56 proven. 1655 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-05 12:03:22,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:22,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 95 [2019-09-05 12:03:22,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-05 12:03:22,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-05 12:03:22,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=7435, Unknown=0, NotChecked=0, Total=8930 [2019-09-05 12:03:22,880 INFO L87 Difference]: Start difference. First operand 242 states and 243 transitions. Second operand 95 states. [2019-09-05 12:03:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:26,580 INFO L93 Difference]: Finished difference Result 255 states and 257 transitions. [2019-09-05 12:03:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-05 12:03:26,580 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 239 [2019-09-05 12:03:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:26,582 INFO L225 Difference]: With dead ends: 255 [2019-09-05 12:03:26,582 INFO L226 Difference]: Without dead ends: 253 [2019-09-05 12:03:26,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5715 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4222, Invalid=19034, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:03:26,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-05 12:03:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 249. [2019-09-05 12:03:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-05 12:03:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2019-09-05 12:03:26,604 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 239 [2019-09-05 12:03:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:26,605 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2019-09-05 12:03:26,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-05 12:03:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2019-09-05 12:03:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-05 12:03:26,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:26,606 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:26,607 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:26,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:26,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1958289263, now seen corresponding path program 57 times [2019-09-05 12:03:26,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:26,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:26,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 1276 proven. 523 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-05 12:03:30,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:30,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:30,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:03:30,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-09-05 12:03:30,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:30,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-05 12:03:30,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:35,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3423 backedges. 141 proven. 1742 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-05 12:03:35,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:35,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 68] total 129 [2019-09-05 12:03:35,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-05 12:03:35,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-05 12:03:35,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1248, Invalid=15264, Unknown=0, NotChecked=0, Total=16512 [2019-09-05 12:03:35,779 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 129 states. [2019-09-05 12:03:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:43,776 INFO L93 Difference]: Finished difference Result 470 states and 475 transitions. [2019-09-05 12:03:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:03:43,777 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 246 [2019-09-05 12:03:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:43,778 INFO L225 Difference]: With dead ends: 470 [2019-09-05 12:03:43,779 INFO L226 Difference]: Without dead ends: 258 [2019-09-05 12:03:43,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6621 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=1507, Invalid=24575, Unknown=0, NotChecked=0, Total=26082 [2019-09-05 12:03:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-05 12:03:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2019-09-05 12:03:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-05 12:03:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2019-09-05 12:03:43,795 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 246 [2019-09-05 12:03:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:43,795 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2019-09-05 12:03:43,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-05 12:03:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2019-09-05 12:03:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-05 12:03:43,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:43,797 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:43,797 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1853529304, now seen corresponding path program 58 times [2019-09-05 12:03:43,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:43,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:43,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:43,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:43,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 523 proven. 1307 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-09-05 12:03:45,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:45,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:45,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:03:45,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:03:45,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:45,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-05 12:03:45,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:45,563 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-09-05 12:03:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3454 backedges. 57 proven. 1857 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-09-05 12:03:47,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:47,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 67] total 99 [2019-09-05 12:03:47,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-05 12:03:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-05 12:03:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1593, Invalid=8109, Unknown=0, NotChecked=0, Total=9702 [2019-09-05 12:03:47,253 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 99 states. [2019-09-05 12:03:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:03:51,545 INFO L93 Difference]: Finished difference Result 263 states and 265 transitions. [2019-09-05 12:03:51,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-05 12:03:51,545 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 247 [2019-09-05 12:03:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:03:51,547 INFO L225 Difference]: With dead ends: 263 [2019-09-05 12:03:51,547 INFO L226 Difference]: Without dead ends: 261 [2019-09-05 12:03:51,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6530 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4574, Invalid=21186, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:03:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-05 12:03:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2019-09-05 12:03:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-05 12:03:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2019-09-05 12:03:51,568 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 247 [2019-09-05 12:03:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:03:51,568 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2019-09-05 12:03:51,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-05 12:03:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2019-09-05 12:03:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-05 12:03:51,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:03:51,570 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:03:51,570 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:03:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:03:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1598213039, now seen corresponding path program 59 times [2019-09-05 12:03:51,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:03:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:03:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:51,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:03:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:03:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:03:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 1365 proven. 556 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-05 12:03:55,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:03:55,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:03:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:03:55,639 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-09-05 12:03:55,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:03:55,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-05 12:03:55,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:03:58,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:58,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:58,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:58,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:03:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3661 backedges. 146 proven. 1862 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-09-05 12:03:58,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:03:58,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70] total 103 [2019-09-05 12:03:58,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-05 12:03:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-05 12:03:58,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=9276, Unknown=0, NotChecked=0, Total=10506 [2019-09-05 12:03:58,687 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 103 states. [2019-09-05 12:04:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:05,488 INFO L93 Difference]: Finished difference Result 485 states and 490 transitions. [2019-09-05 12:04:05,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-05 12:04:05,489 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 254 [2019-09-05 12:04:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:05,491 INFO L225 Difference]: With dead ends: 485 [2019-09-05 12:04:05,491 INFO L226 Difference]: Without dead ends: 266 [2019-09-05 12:04:05,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3546 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1468, Invalid=17164, Unknown=0, NotChecked=0, Total=18632 [2019-09-05 12:04:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-05 12:04:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2019-09-05 12:04:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-05 12:04:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2019-09-05 12:04:05,534 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 254 [2019-09-05 12:04:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:05,534 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2019-09-05 12:04:05,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-05 12:04:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2019-09-05 12:04:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-05 12:04:05,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:05,537 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:05,538 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1074441994, now seen corresponding path program 60 times [2019-09-05 12:04:05,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:05,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:05,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:05,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:05,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 556 proven. 1397 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-05 12:04:07,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:07,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:07,980 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-05 12:04:07,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:07,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-05 12:04:07,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:09,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3693 backedges. 60 proven. 1893 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-09-05 12:04:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:10,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 101 [2019-09-05 12:04:10,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-05 12:04:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-05 12:04:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1690, Invalid=8410, Unknown=0, NotChecked=0, Total=10100 [2019-09-05 12:04:10,082 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 101 states. [2019-09-05 12:04:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:14,165 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2019-09-05 12:04:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-05 12:04:14,166 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 255 [2019-09-05 12:04:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:14,168 INFO L225 Difference]: With dead ends: 271 [2019-09-05 12:04:14,168 INFO L226 Difference]: Without dead ends: 269 [2019-09-05 12:04:14,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4791, Invalid=21615, Unknown=0, NotChecked=0, Total=26406 [2019-09-05 12:04:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-05 12:04:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2019-09-05 12:04:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-05 12:04:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2019-09-05 12:04:14,188 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 255 [2019-09-05 12:04:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:14,189 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2019-09-05 12:04:14,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-05 12:04:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2019-09-05 12:04:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-05 12:04:14,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:14,191 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:14,191 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -797386287, now seen corresponding path program 61 times [2019-09-05 12:04:14,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:14,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:14,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 1457 proven. 590 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-05 12:04:18,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:18,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:18,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:18,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-05 12:04:18,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:21,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:21,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:21,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:21,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3907 backedges. 61 proven. 2076 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-09-05 12:04:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 72] total 106 [2019-09-05 12:04:21,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-05 12:04:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-05 12:04:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1301, Invalid=9829, Unknown=0, NotChecked=0, Total=11130 [2019-09-05 12:04:21,613 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 106 states. [2019-09-05 12:04:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:27,708 INFO L93 Difference]: Finished difference Result 500 states and 505 transitions. [2019-09-05 12:04:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:04:27,709 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 262 [2019-09-05 12:04:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:27,711 INFO L225 Difference]: With dead ends: 500 [2019-09-05 12:04:27,711 INFO L226 Difference]: Without dead ends: 274 [2019-09-05 12:04:27,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3756 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1546, Invalid=18194, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:04:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-05 12:04:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2019-09-05 12:04:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-05 12:04:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 267 transitions. [2019-09-05 12:04:27,736 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 267 transitions. Word has length 262 [2019-09-05 12:04:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:27,736 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 267 transitions. [2019-09-05 12:04:27,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-05 12:04:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 267 transitions. [2019-09-05 12:04:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-05 12:04:27,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:27,738 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:27,738 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash 198256664, now seen corresponding path program 62 times [2019-09-05 12:04:27,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:27,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:27,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:27,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:04:27,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 590 proven. 1490 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-05 12:04:29,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:29,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 12:04:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:29,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:04:29,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:29,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-05 12:04:29,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:31,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 62 proven. 2018 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-09-05 12:04:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 104 [2019-09-05 12:04:31,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-05 12:04:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-05 12:04:31,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=8920, Unknown=0, NotChecked=0, Total=10712 [2019-09-05 12:04:31,309 INFO L87 Difference]: Start difference. First operand 266 states and 267 transitions. Second operand 104 states. [2019-09-05 12:04:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:35,198 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2019-09-05 12:04:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-05 12:04:35,199 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 263 [2019-09-05 12:04:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:35,201 INFO L225 Difference]: With dead ends: 279 [2019-09-05 12:04:35,202 INFO L226 Difference]: Without dead ends: 277 [2019-09-05 12:04:35,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6930 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5089, Invalid=22967, Unknown=0, NotChecked=0, Total=28056 [2019-09-05 12:04:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-05 12:04:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2019-09-05 12:04:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-05 12:04:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2019-09-05 12:04:35,249 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 263 [2019-09-05 12:04:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:35,250 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2019-09-05 12:04:35,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-05 12:04:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2019-09-05 12:04:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-05 12:04:35,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:35,252 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:35,252 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1893013615, now seen corresponding path program 63 times [2019-09-05 12:04:35,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:35,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:35,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:35,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:35,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 1552 proven. 625 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-05 12:04:39,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:39,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:39,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:04:39,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-05 12:04:39,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:39,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-05 12:04:39,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:45,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:45,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:45,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:45,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4161 backedges. 63 proven. 2207 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-09-05 12:04:45,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:45,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74] total 141 [2019-09-05 12:04:45,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-05 12:04:45,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-05 12:04:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1470, Invalid=18270, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:04:45,917 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 141 states. [2019-09-05 12:04:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:04:55,091 INFO L93 Difference]: Finished difference Result 515 states and 520 transitions. [2019-09-05 12:04:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 12:04:55,091 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 270 [2019-09-05 12:04:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:04:55,093 INFO L225 Difference]: With dead ends: 515 [2019-09-05 12:04:55,093 INFO L226 Difference]: Without dead ends: 282 [2019-09-05 12:04:55,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7926 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1753, Invalid=29399, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:04:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-05 12:04:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 274. [2019-09-05 12:04:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-09-05 12:04:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2019-09-05 12:04:55,114 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 270 [2019-09-05 12:04:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:04:55,114 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2019-09-05 12:04:55,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-05 12:04:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2019-09-05 12:04:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-05 12:04:55,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:04:55,116 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:04:55,116 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:04:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:04:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash -856019018, now seen corresponding path program 64 times [2019-09-05 12:04:55,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:04:55,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:04:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:04:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:04:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:04:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 625 proven. 1586 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-09-05 12:04:56,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:04:56,658 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:04:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:04:56,755 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:04:56,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:04:56,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-05 12:04:56,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:04:58,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:04:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4195 backedges. 63 proven. 2241 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-09-05 12:04:58,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:04:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 73] total 108 [2019-09-05 12:04:58,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-05 12:04:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-05 12:04:58,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=9657, Unknown=0, NotChecked=0, Total=11556 [2019-09-05 12:04:58,895 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 108 states. [2019-09-05 12:05:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:03,075 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2019-09-05 12:05:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-05 12:05:03,075 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 271 [2019-09-05 12:05:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:03,077 INFO L225 Difference]: With dead ends: 287 [2019-09-05 12:05:03,077 INFO L226 Difference]: Without dead ends: 285 [2019-09-05 12:05:03,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7826 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5474, Invalid=25326, Unknown=0, NotChecked=0, Total=30800 [2019-09-05 12:05:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-05 12:05:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-09-05 12:05:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-05 12:05:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2019-09-05 12:05:03,104 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 271 [2019-09-05 12:05:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:03,104 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2019-09-05 12:05:03,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-05 12:05:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2019-09-05 12:05:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-05 12:05:03,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:03,106 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:03,106 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 79684369, now seen corresponding path program 65 times [2019-09-05 12:05:03,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:03,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 1650 proven. 661 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-05 12:05:07,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:07,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:07,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:05:07,893 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-09-05 12:05:07,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:07,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-05 12:05:07,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:11,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:11,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:11,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:11,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4423 backedges. 161 proven. 2246 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-09-05 12:05:11,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:11,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 76] total 112 [2019-09-05 12:05:11,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-05 12:05:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-05 12:05:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1449, Invalid=10983, Unknown=0, NotChecked=0, Total=12432 [2019-09-05 12:05:11,448 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 112 states. [2019-09-05 12:05:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:19,417 INFO L93 Difference]: Finished difference Result 530 states and 535 transitions. [2019-09-05 12:05:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-05 12:05:19,418 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 278 [2019-09-05 12:05:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:19,420 INFO L225 Difference]: With dead ends: 530 [2019-09-05 12:05:19,420 INFO L226 Difference]: Without dead ends: 290 [2019-09-05 12:05:19,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4194 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1708, Invalid=20344, Unknown=0, NotChecked=0, Total=22052 [2019-09-05 12:05:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-05 12:05:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2019-09-05 12:05:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-05 12:05:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2019-09-05 12:05:19,441 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 278 [2019-09-05 12:05:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:19,442 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2019-09-05 12:05:19,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-05 12:05:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2019-09-05 12:05:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-05 12:05:19,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:19,443 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:19,444 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1327971496, now seen corresponding path program 66 times [2019-09-05 12:05:19,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:19,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 661 proven. 1685 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-05 12:05:21,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:21,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:05:21,253 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-09-05 12:05:21,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:21,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-05 12:05:21,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4458 backedges. 66 proven. 2280 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2019-09-05 12:05:23,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:23,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 110 [2019-09-05 12:05:23,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-05 12:05:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-05 12:05:23,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2005, Invalid=9985, Unknown=0, NotChecked=0, Total=11990 [2019-09-05 12:05:23,499 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 110 states. [2019-09-05 12:05:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:27,834 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2019-09-05 12:05:27,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-05 12:05:27,835 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 279 [2019-09-05 12:05:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:27,837 INFO L225 Difference]: With dead ends: 295 [2019-09-05 12:05:27,837 INFO L226 Difference]: Without dead ends: 293 [2019-09-05 12:05:27,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7805 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5712, Invalid=25794, Unknown=0, NotChecked=0, Total=31506 [2019-09-05 12:05:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-05 12:05:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2019-09-05 12:05:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-05 12:05:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2019-09-05 12:05:27,859 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 279 [2019-09-05 12:05:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:27,859 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2019-09-05 12:05:27,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-05 12:05:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2019-09-05 12:05:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-05 12:05:27,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:27,861 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:27,861 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1268493009, now seen corresponding path program 67 times [2019-09-05 12:05:27,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:27,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 1751 proven. 698 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-05 12:05:32,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:32,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:32,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:32,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-05 12:05:32,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4693 backedges. 67 proven. 2481 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-09-05 12:05:36,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:36,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78] total 115 [2019-09-05 12:05:36,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-05 12:05:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-05 12:05:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1526, Invalid=11584, Unknown=0, NotChecked=0, Total=13110 [2019-09-05 12:05:36,452 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 115 states. [2019-09-05 12:05:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:45,133 INFO L93 Difference]: Finished difference Result 545 states and 550 transitions. [2019-09-05 12:05:45,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:05:45,134 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 286 [2019-09-05 12:05:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:45,136 INFO L225 Difference]: With dead ends: 545 [2019-09-05 12:05:45,136 INFO L226 Difference]: Without dead ends: 298 [2019-09-05 12:05:45,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4422 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1792, Invalid=21464, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:05:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-05 12:05:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2019-09-05 12:05:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-05 12:05:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2019-09-05 12:05:45,159 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 286 [2019-09-05 12:05:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:45,159 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2019-09-05 12:05:45,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-05 12:05:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2019-09-05 12:05:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-05 12:05:45,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:45,161 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:45,161 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash -929563018, now seen corresponding path program 68 times [2019-09-05 12:05:45,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:45,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:45,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:05:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 698 proven. 1787 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-05 12:05:46,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:46,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:46,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:05:46,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:05:46,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:46,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-05 12:05:46,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:05:49,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:05:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4729 backedges. 68 proven. 2417 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2019-09-05 12:05:49,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:05:49,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 113 [2019-09-05 12:05:49,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-05 12:05:49,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-05 12:05:49,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2116, Invalid=10540, Unknown=0, NotChecked=0, Total=12656 [2019-09-05 12:05:49,325 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 113 states. [2019-09-05 12:05:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:05:54,701 INFO L93 Difference]: Finished difference Result 303 states and 305 transitions. [2019-09-05 12:05:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-05 12:05:54,701 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 287 [2019-09-05 12:05:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:05:54,703 INFO L225 Difference]: With dead ends: 303 [2019-09-05 12:05:54,704 INFO L226 Difference]: Without dead ends: 301 [2019-09-05 12:05:54,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8262 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=6037, Invalid=27269, Unknown=0, NotChecked=0, Total=33306 [2019-09-05 12:05:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-05 12:05:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2019-09-05 12:05:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-05 12:05:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2019-09-05 12:05:54,725 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 287 [2019-09-05 12:05:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:05:54,726 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2019-09-05 12:05:54,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-05 12:05:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2019-09-05 12:05:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-05 12:05:54,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:05:54,727 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:05:54,727 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:05:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:05:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1233124433, now seen corresponding path program 69 times [2019-09-05 12:05:54,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:05:54,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:05:54,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:54,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:05:54,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:05:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:05:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 1855 proven. 736 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-05 12:05:59,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:05:59,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:05:59,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:05:59,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-09-05 12:05:59,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:05:59,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-05 12:05:59,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:06,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:06,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:06,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4971 backedges. 171 proven. 2522 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-05 12:06:07,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:07,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 80] total 153 [2019-09-05 12:06:07,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-05 12:06:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-05 12:06:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1710, Invalid=21546, Unknown=0, NotChecked=0, Total=23256 [2019-09-05 12:06:07,158 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 153 states. [2019-09-05 12:06:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:19,147 INFO L93 Difference]: Finished difference Result 560 states and 565 transitions. [2019-09-05 12:06:19,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 12:06:19,147 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 294 [2019-09-05 12:06:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:19,150 INFO L225 Difference]: With dead ends: 560 [2019-09-05 12:06:19,150 INFO L226 Difference]: Without dead ends: 306 [2019-09-05 12:06:19,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9348 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2017, Invalid=34655, Unknown=0, NotChecked=0, Total=36672 [2019-09-05 12:06:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-05 12:06:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2019-09-05 12:06:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-05 12:06:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2019-09-05 12:06:19,179 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 294 [2019-09-05 12:06:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:19,179 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2019-09-05 12:06:19,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-05 12:06:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2019-09-05 12:06:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-05 12:06:19,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:19,181 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:19,181 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -956993896, now seen corresponding path program 70 times [2019-09-05 12:06:19,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:19,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:19,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:19,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 736 proven. 1892 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-05 12:06:21,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:21,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:21,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:06:21,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:06:21,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:21,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-05 12:06:21,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:23,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5008 backedges. 69 proven. 2661 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-09-05 12:06:23,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 79] total 117 [2019-09-05 12:06:23,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-05 12:06:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-05 12:06:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=11340, Unknown=0, NotChecked=0, Total=13572 [2019-09-05 12:06:23,606 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 117 states. [2019-09-05 12:06:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:29,248 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2019-09-05 12:06:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-05 12:06:29,249 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 295 [2019-09-05 12:06:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:29,251 INFO L225 Difference]: With dead ends: 311 [2019-09-05 12:06:29,251 INFO L226 Difference]: Without dead ends: 309 [2019-09-05 12:06:29,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9239 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6455, Invalid=29835, Unknown=0, NotChecked=0, Total=36290 [2019-09-05 12:06:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-05 12:06:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2019-09-05 12:06:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-05 12:06:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2019-09-05 12:06:29,278 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 295 [2019-09-05 12:06:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:29,278 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2019-09-05 12:06:29,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-05 12:06:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2019-09-05 12:06:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-05 12:06:29,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:29,280 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:29,280 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash 671908335, now seen corresponding path program 71 times [2019-09-05 12:06:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:29,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 1962 proven. 775 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-05 12:06:34,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:34,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:34,534 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:06:34,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-05 12:06:34,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:34,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-05 12:06:34,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:38,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:38,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:38,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:38,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5257 backedges. 176 proven. 2666 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-09-05 12:06:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:38,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82] total 121 [2019-09-05 12:06:38,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-05 12:06:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-05 12:06:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=12834, Unknown=0, NotChecked=0, Total=14520 [2019-09-05 12:06:38,835 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 121 states. [2019-09-05 12:06:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:46,512 INFO L93 Difference]: Finished difference Result 575 states and 580 transitions. [2019-09-05 12:06:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-05 12:06:46,513 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 302 [2019-09-05 12:06:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:46,515 INFO L225 Difference]: With dead ends: 575 [2019-09-05 12:06:46,515 INFO L226 Difference]: Without dead ends: 314 [2019-09-05 12:06:46,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1966, Invalid=23794, Unknown=0, NotChecked=0, Total=25760 [2019-09-05 12:06:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-05 12:06:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 306. [2019-09-05 12:06:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-05 12:06:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2019-09-05 12:06:46,548 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 302 [2019-09-05 12:06:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:46,548 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2019-09-05 12:06:46,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-05 12:06:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2019-09-05 12:06:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-05 12:06:46,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:46,550 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:46,550 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:46,551 INFO L82 PathProgramCache]: Analyzing trace with hash -118833866, now seen corresponding path program 72 times [2019-09-05 12:06:46,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:46,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:46,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:46,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:06:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 775 proven. 2000 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-05 12:06:48,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:06:48,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:06:48,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:06:48,641 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-05 12:06:48,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:06:48,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-05 12:06:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:06:51,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:06:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5295 backedges. 72 proven. 2703 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-09-05 12:06:51,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:06:51,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 119 [2019-09-05 12:06:51,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-05 12:06:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-05 12:06:51,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2347, Invalid=11695, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 12:06:51,197 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 119 states. [2019-09-05 12:06:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:06:56,839 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2019-09-05 12:06:56,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-05 12:06:56,840 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 303 [2019-09-05 12:06:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:06:56,842 INFO L225 Difference]: With dead ends: 319 [2019-09-05 12:06:56,842 INFO L226 Difference]: Without dead ends: 317 [2019-09-05 12:06:56,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9215 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6714, Invalid=30342, Unknown=0, NotChecked=0, Total=37056 [2019-09-05 12:06:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-05 12:06:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2019-09-05 12:06:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-05 12:06:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2019-09-05 12:06:56,868 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 303 [2019-09-05 12:06:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:06:56,869 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2019-09-05 12:06:56,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-05 12:06:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2019-09-05 12:06:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-05 12:06:56,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:06:56,871 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:06:56,871 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:06:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:06:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2128796271, now seen corresponding path program 73 times [2019-09-05 12:06:56,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:06:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:06:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:56,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:06:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:06:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 2072 proven. 815 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-05 12:07:02,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:02,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:02,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:02,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-05 12:07:02,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:06,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:06,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:06,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:06,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 73 proven. 2922 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-09-05 12:07:06,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:06,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 84] total 124 [2019-09-05 12:07:06,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-05 12:07:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-05 12:07:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1769, Invalid=13483, Unknown=0, NotChecked=0, Total=15252 [2019-09-05 12:07:06,790 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 124 states. [2019-09-05 12:07:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:17,040 INFO L93 Difference]: Finished difference Result 590 states and 595 transitions. [2019-09-05 12:07:17,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:07:17,041 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 310 [2019-09-05 12:07:17,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:17,043 INFO L225 Difference]: With dead ends: 590 [2019-09-05 12:07:17,043 INFO L226 Difference]: Without dead ends: 322 [2019-09-05 12:07:17,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5142 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2056, Invalid=25004, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:07:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-05 12:07:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2019-09-05 12:07:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-05 12:07:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 315 transitions. [2019-09-05 12:07:17,075 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 315 transitions. Word has length 310 [2019-09-05 12:07:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:17,075 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 315 transitions. [2019-09-05 12:07:17,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-05 12:07:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 315 transitions. [2019-09-05 12:07:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-05 12:07:17,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:17,077 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:17,077 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2022386136, now seen corresponding path program 74 times [2019-09-05 12:07:17,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:17,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:17,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:07:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 815 proven. 2111 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-05 12:07:19,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:19,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:07:19,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:07:19,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:19,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-05 12:07:19,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:21,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5590 backedges. 74 proven. 2852 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2019-09-05 12:07:21,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:21,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 122 [2019-09-05 12:07:21,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-05 12:07:21,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-05 12:07:21,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=12295, Unknown=0, NotChecked=0, Total=14762 [2019-09-05 12:07:21,848 INFO L87 Difference]: Start difference. First operand 314 states and 315 transitions. Second operand 122 states. [2019-09-05 12:07:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:27,623 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2019-09-05 12:07:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-05 12:07:27,623 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 311 [2019-09-05 12:07:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:27,625 INFO L225 Difference]: With dead ends: 327 [2019-09-05 12:07:27,625 INFO L226 Difference]: Without dead ends: 325 [2019-09-05 12:07:27,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9711 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7066, Invalid=31940, Unknown=0, NotChecked=0, Total=39006 [2019-09-05 12:07:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-05 12:07:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-09-05 12:07:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-05 12:07:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2019-09-05 12:07:27,649 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 311 [2019-09-05 12:07:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:27,649 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2019-09-05 12:07:27,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-05 12:07:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2019-09-05 12:07:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-05 12:07:27,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:27,650 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:27,651 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash -387342673, now seen corresponding path program 75 times [2019-09-05 12:07:27,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:27,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:27,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 2185 proven. 856 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-05 12:07:33,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:33,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:07:33,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-09-05 12:07:33,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:33,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-05 12:07:33,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:07:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:41,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:07:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5853 backedges. 75 proven. 3077 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-09-05 12:07:41,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:07:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 86] total 165 [2019-09-05 12:07:41,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-05 12:07:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-05 12:07:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1968, Invalid=25092, Unknown=0, NotChecked=0, Total=27060 [2019-09-05 12:07:41,938 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 165 states. [2019-09-05 12:07:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:07:56,187 INFO L93 Difference]: Finished difference Result 605 states and 610 transitions. [2019-09-05 12:07:56,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 12:07:56,188 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 318 [2019-09-05 12:07:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:07:56,190 INFO L225 Difference]: With dead ends: 605 [2019-09-05 12:07:56,190 INFO L226 Difference]: Without dead ends: 330 [2019-09-05 12:07:56,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 236 SyntacticMatches, 3 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10887 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=2299, Invalid=40343, Unknown=0, NotChecked=0, Total=42642 [2019-09-05 12:07:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-05 12:07:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 322. [2019-09-05 12:07:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-05 12:07:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 323 transitions. [2019-09-05 12:07:56,215 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 323 transitions. Word has length 318 [2019-09-05 12:07:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:07:56,215 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 323 transitions. [2019-09-05 12:07:56,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-05 12:07:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 323 transitions. [2019-09-05 12:07:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-05 12:07:56,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:07:56,216 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:07:56,216 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:07:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:07:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1022465034, now seen corresponding path program 76 times [2019-09-05 12:07:56,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:07:56,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:07:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:56,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:07:56,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:07:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:07:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5893 backedges. 856 proven. 2225 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2019-09-05 12:07:58,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:07:58,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:07:58,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:07:58,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:07:58,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:07:58,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-05 12:07:58,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:01,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5893 backedges. 75 proven. 3117 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-09-05 12:08:01,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:01,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 85] total 126 [2019-09-05 12:08:01,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-05 12:08:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-05 12:08:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2592, Invalid=13158, Unknown=0, NotChecked=0, Total=15750 [2019-09-05 12:08:01,380 INFO L87 Difference]: Start difference. First operand 322 states and 323 transitions. Second operand 126 states. [2019-09-05 12:08:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:07,944 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2019-09-05 12:08:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-05 12:08:07,945 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 319 [2019-09-05 12:08:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:07,946 INFO L225 Difference]: With dead ends: 335 [2019-09-05 12:08:07,947 INFO L226 Difference]: Without dead ends: 333 [2019-09-05 12:08:07,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10769 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7517, Invalid=34713, Unknown=0, NotChecked=0, Total=42230 [2019-09-05 12:08:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-05 12:08:07,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2019-09-05 12:08:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-05 12:08:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2019-09-05 12:08:07,971 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 319 [2019-09-05 12:08:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:07,971 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2019-09-05 12:08:07,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-05 12:08:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2019-09-05 12:08:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-05 12:08:07,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:07,973 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:07,973 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1896128815, now seen corresponding path program 77 times [2019-09-05 12:08:07,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:07,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:07,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 2301 proven. 898 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-05 12:08:14,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:14,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:08:14,249 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-09-05 12:08:14,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:14,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-05 12:08:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:18,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:18,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:18,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:18,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6163 backedges. 191 proven. 3122 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-09-05 12:08:18,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:18,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 88] total 130 [2019-09-05 12:08:18,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-05 12:08:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-05 12:08:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1941, Invalid=14829, Unknown=0, NotChecked=0, Total=16770 [2019-09-05 12:08:18,987 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 130 states. [2019-09-05 12:08:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:30,055 INFO L93 Difference]: Finished difference Result 620 states and 625 transitions. [2019-09-05 12:08:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-05 12:08:30,055 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 326 [2019-09-05 12:08:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:30,058 INFO L225 Difference]: With dead ends: 620 [2019-09-05 12:08:30,058 INFO L226 Difference]: Without dead ends: 338 [2019-09-05 12:08:30,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 282 SyntacticMatches, 2 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5652 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2242, Invalid=27514, Unknown=0, NotChecked=0, Total=29756 [2019-09-05 12:08:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-05 12:08:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2019-09-05 12:08:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-05 12:08:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2019-09-05 12:08:30,083 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 326 [2019-09-05 12:08:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:30,083 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2019-09-05 12:08:30,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-05 12:08:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2019-09-05 12:08:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-05 12:08:30,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:30,084 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:30,084 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:30,085 INFO L82 PathProgramCache]: Analyzing trace with hash -251792104, now seen corresponding path program 78 times [2019-09-05 12:08:30,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:30,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:30,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:30,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6204 backedges. 898 proven. 2342 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-05 12:08:32,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:32,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:32,299 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:08:32,455 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-09-05 12:08:32,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:08:32,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-05 12:08:32,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6204 backedges. 78 proven. 3162 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-09-05 12:08:35,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:35,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 128 [2019-09-05 12:08:35,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-05 12:08:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-05 12:08:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2716, Invalid=13540, Unknown=0, NotChecked=0, Total=16256 [2019-09-05 12:08:35,401 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 128 states. [2019-09-05 12:08:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:08:42,196 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2019-09-05 12:08:42,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-05 12:08:42,197 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 327 [2019-09-05 12:08:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:08:42,199 INFO L225 Difference]: With dead ends: 343 [2019-09-05 12:08:42,200 INFO L226 Difference]: Without dead ends: 341 [2019-09-05 12:08:42,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10742 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7797, Invalid=35259, Unknown=0, NotChecked=0, Total=43056 [2019-09-05 12:08:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-05 12:08:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2019-09-05 12:08:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-05 12:08:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2019-09-05 12:08:42,224 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 327 [2019-09-05 12:08:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:08:42,225 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2019-09-05 12:08:42,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-05 12:08:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2019-09-05 12:08:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-05 12:08:42,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:08:42,226 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:08:42,226 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:08:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:08:42,226 INFO L82 PathProgramCache]: Analyzing trace with hash -216552593, now seen corresponding path program 79 times [2019-09-05 12:08:42,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:08:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:08:42,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:42,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:08:42,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:08:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 2420 proven. 941 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-05 12:08:48,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:08:48,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:08:48,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:08:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:08:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-05 12:08:48,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:08:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:53,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:53,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:08:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6481 backedges. 79 proven. 3399 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-09-05 12:08:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:08:53,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 90] total 133 [2019-09-05 12:08:53,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-05 12:08:53,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-05 12:08:53,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2030, Invalid=15526, Unknown=0, NotChecked=0, Total=17556 [2019-09-05 12:08:53,699 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 133 states. [2019-09-05 12:09:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:05,216 INFO L93 Difference]: Finished difference Result 635 states and 640 transitions. [2019-09-05 12:09:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 12:09:05,217 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 334 [2019-09-05 12:09:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:05,219 INFO L225 Difference]: With dead ends: 635 [2019-09-05 12:09:05,219 INFO L226 Difference]: Without dead ends: 346 [2019-09-05 12:09:05,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5916 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2338, Invalid=28814, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:09:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-05 12:09:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 338. [2019-09-05 12:09:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-05 12:09:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 339 transitions. [2019-09-05 12:09:05,247 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 339 transitions. Word has length 334 [2019-09-05 12:09:05,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:05,247 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 339 transitions. [2019-09-05 12:09:05,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-05 12:09:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 339 transitions. [2019-09-05 12:09:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-05 12:09:05,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:05,249 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:05,249 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:05,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1797196470, now seen corresponding path program 80 times [2019-09-05 12:09:05,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:05,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:05,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:09:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6523 backedges. 941 proven. 2462 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-05 12:09:07,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:07,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:07,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:09:07,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:09:07,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:07,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-05 12:09:07,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:10,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6523 backedges. 80 proven. 3323 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2019-09-05 12:09:10,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:10,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 131 [2019-09-05 12:09:10,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-05 12:09:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-05 12:09:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2845, Invalid=14185, Unknown=0, NotChecked=0, Total=17030 [2019-09-05 12:09:10,856 INFO L87 Difference]: Start difference. First operand 338 states and 339 transitions. Second operand 131 states. [2019-09-05 12:09:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:16,926 INFO L93 Difference]: Finished difference Result 351 states and 353 transitions. [2019-09-05 12:09:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-05 12:09:16,926 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 335 [2019-09-05 12:09:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:16,929 INFO L225 Difference]: With dead ends: 351 [2019-09-05 12:09:16,929 INFO L226 Difference]: Without dead ends: 349 [2019-09-05 12:09:16,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11277 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=8176, Invalid=36980, Unknown=0, NotChecked=0, Total=45156 [2019-09-05 12:09:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-05 12:09:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2019-09-05 12:09:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-05 12:09:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2019-09-05 12:09:16,967 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 335 [2019-09-05 12:09:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:16,968 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2019-09-05 12:09:16,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-05 12:09:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2019-09-05 12:09:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-05 12:09:16,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:16,969 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:16,969 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:16,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1753307119, now seen corresponding path program 81 times [2019-09-05 12:09:16,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:16,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:16,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:16,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 2542 proven. 985 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-05 12:09:23,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:23,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:23,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:09:23,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-09-05 12:09:23,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:23,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 182 conjunts are in the unsatisfiable core [2019-09-05 12:09:23,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:32,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:32,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:33,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6807 backedges. 201 proven. 3446 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-09-05 12:09:33,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:33,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 92] total 177 [2019-09-05 12:09:33,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-05 12:09:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-05 12:09:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2244, Invalid=28908, Unknown=0, NotChecked=0, Total=31152 [2019-09-05 12:09:33,471 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 177 states. [2019-09-05 12:09:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:45,573 INFO L93 Difference]: Finished difference Result 650 states and 655 transitions. [2019-09-05 12:09:45,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-05 12:09:45,574 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 342 [2019-09-05 12:09:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:45,576 INFO L225 Difference]: With dead ends: 650 [2019-09-05 12:09:45,576 INFO L226 Difference]: Without dead ends: 354 [2019-09-05 12:09:45,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=2599, Invalid=46463, Unknown=0, NotChecked=0, Total=49062 [2019-09-05 12:09:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-05 12:09:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 346. [2019-09-05 12:09:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-05 12:09:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2019-09-05 12:09:45,604 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 342 [2019-09-05 12:09:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:45,604 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2019-09-05 12:09:45,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-05 12:09:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2019-09-05 12:09:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-05 12:09:45,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:45,606 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:45,606 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1666068392, now seen corresponding path program 82 times [2019-09-05 12:09:45,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:45,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:09:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6850 backedges. 985 proven. 2585 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2019-09-05 12:09:48,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:09:48,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:09:48,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:09:48,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:09:48,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:09:48,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-05 12:09:48,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:09:51,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:09:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6850 backedges. 81 proven. 3609 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-09-05 12:09:51,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:09:51,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 91] total 135 [2019-09-05 12:09:51,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-05 12:09:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-05 12:09:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2979, Invalid=15111, Unknown=0, NotChecked=0, Total=18090 [2019-09-05 12:09:51,464 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 135 states. [2019-09-05 12:09:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:09:57,880 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2019-09-05 12:09:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-05 12:09:57,880 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 343 [2019-09-05 12:09:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:09:57,882 INFO L225 Difference]: With dead ends: 359 [2019-09-05 12:09:57,882 INFO L226 Difference]: Without dead ends: 357 [2019-09-05 12:09:57,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12416 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=8660, Invalid=39960, Unknown=0, NotChecked=0, Total=48620 [2019-09-05 12:09:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-05 12:09:57,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 353. [2019-09-05 12:09:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-05 12:09:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2019-09-05 12:09:57,910 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 343 [2019-09-05 12:09:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:09:57,911 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2019-09-05 12:09:57,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-05 12:09:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2019-09-05 12:09:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-05 12:09:57,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:09:57,913 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:09:57,913 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:09:57,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:09:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash -508385233, now seen corresponding path program 83 times [2019-09-05 12:09:57,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:09:57,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:09:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:09:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:09:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 2667 proven. 1030 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-05 12:10:04,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:04,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:04,770 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 12:10:04,933 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-09-05 12:10:04,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:04,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 185 conjunts are in the unsatisfiable core [2019-09-05 12:10:04,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:09,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:09,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:09,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 101 proven. 3719 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-09-05 12:10:10,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 94] total 139 [2019-09-05 12:10:10,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-05 12:10:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-05 12:10:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=16968, Unknown=0, NotChecked=0, Total=19182 [2019-09-05 12:10:10,325 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 139 states. [2019-09-05 12:10:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:21,746 INFO L93 Difference]: Finished difference Result 665 states and 670 transitions. [2019-09-05 12:10:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-05 12:10:21,747 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 350 [2019-09-05 12:10:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:21,749 INFO L225 Difference]: With dead ends: 665 [2019-09-05 12:10:21,750 INFO L226 Difference]: Without dead ends: 362 [2019-09-05 12:10:21,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6462 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=2536, Invalid=31504, Unknown=0, NotChecked=0, Total=34040 [2019-09-05 12:10:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-05 12:10:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2019-09-05 12:10:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-05 12:10:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2019-09-05 12:10:21,778 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 350 [2019-09-05 12:10:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:21,778 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 355 transitions. [2019-09-05 12:10:21,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-05 12:10:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 355 transitions. [2019-09-05 12:10:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-09-05 12:10:21,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:21,779 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:21,780 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash -734488202, now seen corresponding path program 84 times [2019-09-05 12:10:21,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:21,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:21,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 1030 proven. 2711 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-05 12:10:24,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:24,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:24,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 12:10:24,525 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-05 12:10:24,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:10:24,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-05 12:10:24,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:27,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7185 backedges. 101 proven. 3763 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-09-05 12:10:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:27,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 93] total 138 [2019-09-05 12:10:27,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-05 12:10:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-05 12:10:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3114, Invalid=15792, Unknown=0, NotChecked=0, Total=18906 [2019-09-05 12:10:27,952 INFO L87 Difference]: Start difference. First operand 354 states and 355 transitions. Second operand 138 states. [2019-09-05 12:10:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:35,358 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2019-09-05 12:10:35,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-05 12:10:35,359 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 351 [2019-09-05 12:10:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:35,361 INFO L225 Difference]: With dead ends: 367 [2019-09-05 12:10:35,362 INFO L226 Difference]: Without dead ends: 365 [2019-09-05 12:10:35,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12985 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=9059, Invalid=41791, Unknown=0, NotChecked=0, Total=50850 [2019-09-05 12:10:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-05 12:10:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2019-09-05 12:10:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-05 12:10:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2019-09-05 12:10:35,389 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 351 [2019-09-05 12:10:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:35,390 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2019-09-05 12:10:35,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-05 12:10:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2019-09-05 12:10:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-05 12:10:35,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:35,391 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:35,391 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1074463057, now seen corresponding path program 85 times [2019-09-05 12:10:35,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:35,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:35,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:10:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 2795 proven. 1076 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-05 12:10:42,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:10:42,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:10:42,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:10:42,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 189 conjunts are in the unsatisfiable core [2019-09-05 12:10:42,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:10:47,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:47,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:47,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:47,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:10:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7483 backedges. 85 proven. 3912 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-09-05 12:10:48,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:10:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 96] total 142 [2019-09-05 12:10:48,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-05 12:10:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-05 12:10:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2309, Invalid=17713, Unknown=0, NotChecked=0, Total=20022 [2019-09-05 12:10:48,319 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 142 states. [2019-09-05 12:10:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:10:58,868 INFO L93 Difference]: Finished difference Result 680 states and 685 transitions. [2019-09-05 12:10:58,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-05 12:10:58,869 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 358 [2019-09-05 12:10:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:10:58,872 INFO L225 Difference]: With dead ends: 680 [2019-09-05 12:10:58,872 INFO L226 Difference]: Without dead ends: 370 [2019-09-05 12:10:58,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6744 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=2638, Invalid=32894, Unknown=0, NotChecked=0, Total=35532 [2019-09-05 12:10:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-05 12:10:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2019-09-05 12:10:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-05 12:10:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 363 transitions. [2019-09-05 12:10:58,914 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 363 transitions. Word has length 358 [2019-09-05 12:10:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:10:58,914 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 363 transitions. [2019-09-05 12:10:58,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-05 12:10:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 363 transitions. [2019-09-05 12:10:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-09-05 12:10:58,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:10:58,916 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:10:58,917 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:10:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:10:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1762311064, now seen corresponding path program 86 times [2019-09-05 12:10:58,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:10:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:10:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:10:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:10:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 1076 proven. 2840 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2019-09-05 12:11:01,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:01,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:01,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:11:01,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:11:01,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:01,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-05 12:11:01,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:05,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7528 backedges. 85 proven. 3957 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-09-05 12:11:05,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:05,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 95] total 141 [2019-09-05 12:11:05,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-05 12:11:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-05 12:11:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=16488, Unknown=0, NotChecked=0, Total=19740 [2019-09-05 12:11:05,270 INFO L87 Difference]: Start difference. First operand 362 states and 363 transitions. Second operand 141 states. [2019-09-05 12:11:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:12,291 INFO L93 Difference]: Finished difference Result 375 states and 377 transitions. [2019-09-05 12:11:12,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 12:11:12,292 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 359 [2019-09-05 12:11:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:12,294 INFO L225 Difference]: With dead ends: 375 [2019-09-05 12:11:12,294 INFO L226 Difference]: Without dead ends: 373 [2019-09-05 12:11:12,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13579 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=9467, Invalid=43663, Unknown=0, NotChecked=0, Total=53130 [2019-09-05 12:11:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-05 12:11:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2019-09-05 12:11:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-05 12:11:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2019-09-05 12:11:12,323 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 359 [2019-09-05 12:11:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:12,323 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2019-09-05 12:11:12,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-05 12:11:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2019-09-05 12:11:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-05 12:11:12,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:12,325 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:12,325 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1361668881, now seen corresponding path program 87 times [2019-09-05 12:11:12,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:12,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:12,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 2926 proven. 1123 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-05 12:11:20,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:20,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 12:11:20,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-09-05 12:11:20,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:20,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 194 conjunts are in the unsatisfiable core [2019-09-05 12:11:20,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:30,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:30,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7833 backedges. 87 proven. 4091 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-09-05 12:11:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 98] total 189 [2019-09-05 12:11:31,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 189 states [2019-09-05 12:11:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2019-09-05 12:11:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2538, Invalid=32994, Unknown=0, NotChecked=0, Total=35532 [2019-09-05 12:11:31,151 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 189 states. [2019-09-05 12:11:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:11:48,829 INFO L93 Difference]: Finished difference Result 695 states and 700 transitions. [2019-09-05 12:11:48,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-05 12:11:48,829 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 366 [2019-09-05 12:11:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:11:48,831 INFO L225 Difference]: With dead ends: 695 [2019-09-05 12:11:48,831 INFO L226 Difference]: Without dead ends: 378 [2019-09-05 12:11:48,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 272 SyntacticMatches, 3 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14316 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=2917, Invalid=53015, Unknown=0, NotChecked=0, Total=55932 [2019-09-05 12:11:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-05 12:11:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-09-05 12:11:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-05 12:11:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 371 transitions. [2019-09-05 12:11:48,861 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 371 transitions. Word has length 366 [2019-09-05 12:11:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:11:48,861 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 371 transitions. [2019-09-05 12:11:48,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 189 states. [2019-09-05 12:11:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 371 transitions. [2019-09-05 12:11:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-05 12:11:48,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:11:48,863 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:11:48,863 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:11:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:11:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1081546806, now seen corresponding path program 88 times [2019-09-05 12:11:48,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:11:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:11:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:48,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:11:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:11:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:11:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7879 backedges. 1123 proven. 2972 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-05 12:11:51,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 12:11:51,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 12:11:51,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:11:51,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:11:51,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:11:51,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-05 12:11:51,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:11:55,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:11:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7879 backedges. 87 proven. 4137 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-09-05 12:11:55,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 12:11:55,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 97] total 144 [2019-09-05 12:11:55,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-05 12:11:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-05 12:11:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3393, Invalid=17199, Unknown=0, NotChecked=0, Total=20592 [2019-09-05 12:11:55,508 INFO L87 Difference]: Start difference. First operand 370 states and 371 transitions. Second operand 144 states.