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-new/count_by_nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:55:50,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:55:50,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:55:50,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:55:50,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:55:50,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:55:50,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:55:50,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:55:50,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:55:50,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:55:50,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:55:50,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:55:50,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:55:50,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:55:50,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:55:50,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:55:50,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:55:50,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:55:50,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:55:50,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:55:50,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:55:50,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:55:50,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:55:50,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:55:50,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:55:50,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:55:50,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:55:50,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:55:50,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:55:50,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:55:50,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:55:50,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:55:50,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:55:50,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:55:50,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:55:50,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:55:50,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:55:50,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:55:50,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:55:50,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:55:50,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:55:50,214 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-03 19:55:50,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:55:50,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:55:50,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:55:50,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:55:50,231 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:55:50,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:55:50,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:55:50,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:55:50,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:55:50,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:55:50,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:55:50,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:55:50,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:55:50,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:55:50,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:55:50,235 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:55:50,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:55:50,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:55:50,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:55:50,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:55:50,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:55:50,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:55:50,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:55:50,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:55:50,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:55:50,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:55:50,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:55:50,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:55:50,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:55:50,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:55:50,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:55:50,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:55:50,299 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:55:50,299 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:55:50,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_nondet.i [2019-09-03 19:55:50,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266cdd0aa/7db91d28afde432f82959f0211ec3a1d/FLAG16a842f6b [2019-09-03 19:55:50,773 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:55:50,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_nondet.i [2019-09-03 19:55:50,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266cdd0aa/7db91d28afde432f82959f0211ec3a1d/FLAG16a842f6b [2019-09-03 19:55:51,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266cdd0aa/7db91d28afde432f82959f0211ec3a1d [2019-09-03 19:55:51,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:55:51,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:55:51,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:55:51,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:55:51,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:55:51,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d21465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51, skipping insertion in model container [2019-09-03 19:55:51,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,207 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:55:51,219 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:55:51,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:55:51,373 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:55:51,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:55:51,401 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:55:51,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51 WrapperNode [2019-09-03 19:55:51,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:55:51,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:55:51,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:55:51,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:55:51,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (1/1) ... [2019-09-03 19:55:51,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:55:51,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:55:51,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:55:51,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:55:51,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (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-03 19:55:51,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:55:51,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:55:51,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:55:51,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:55:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:55:51,717 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:55:51,717 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:55:51,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:55:51 BoogieIcfgContainer [2019-09-03 19:55:51,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:55:51,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:55:51,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:55:51,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:55:51,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:55:51" (1/3) ... [2019-09-03 19:55:51,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2764f8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:55:51, skipping insertion in model container [2019-09-03 19:55:51,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:55:51" (2/3) ... [2019-09-03 19:55:51,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2764f8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:55:51, skipping insertion in model container [2019-09-03 19:55:51,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:55:51" (3/3) ... [2019-09-03 19:55:51,726 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i [2019-09-03 19:55:51,736 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:55:51,743 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:55:51,760 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:55:51,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:55:51,815 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:55:51,816 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:55:51,816 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:55:51,816 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:55:51,816 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:55:51,817 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:55:51,817 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:55:51,817 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:55:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 19:55:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:55:51,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:51,849 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:51,853 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1137787585, now seen corresponding path program 1 times [2019-09-03 19:55:51,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:51,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:51,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:51,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:51,971 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-03 19:55:51,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:55:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:55:51,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:55:51,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:55:51,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:55:51,989 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 19:55:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,008 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-03 19:55:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:55:52,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 19:55:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,017 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:55:52,017 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:55:52,021 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-03 19:55:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:55:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:55:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:55:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 19:55:52,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 19:55:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:52,058 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 19:55:52,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:55:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 19:55:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:55:52,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:52,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:52,060 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1130399417, now seen corresponding path program 1 times [2019-09-03 19:55:52,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:52,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:52,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,106 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-03 19:55:52,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:55:52,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:55:52,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:55:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:55:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:55:52,109 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-03 19:55:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,146 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:55:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:55:52,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:55:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,148 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:55:52,148 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:55:52,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:55:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:55:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-03 19:55:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:55:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 19:55:52,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-03 19:55:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:52,161 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 19:55:52,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:55:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 19:55:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:55:52,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:52,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:52,162 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:52,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:52,163 INFO L82 PathProgramCache]: Analyzing trace with hash 820627669, now seen corresponding path program 1 times [2019-09-03 19:55:52,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:52,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:52,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,231 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-03 19:55:52,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:52,232 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-03 19:55:52,250 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-03 19:55:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:55:52,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:52,315 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-03 19:55:52,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:52,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-03 19:55:52,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:55:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:55:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:55:52,322 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-03 19:55:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,350 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 19:55:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:55:52,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:55:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,354 INFO L225 Difference]: With dead ends: 20 [2019-09-03 19:55:52,354 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 19:55:52,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:55:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 19:55:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 19:55:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:55:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:55:52,359 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-03 19:55:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:52,359 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:55:52,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:55:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:55:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:55:52,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:52,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:52,361 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash -517278735, now seen corresponding path program 2 times [2019-09-03 19:55:52,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:52,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:52,462 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03 19:55:52,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:52,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:52,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:52,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:55:52,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:52,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:52,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-09-03 19:55:52,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:55:52,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:55:52,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:55:52,541 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2019-09-03 19:55:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,586 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-03 19:55:52,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:55:52,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-09-03 19:55:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,588 INFO L225 Difference]: With dead ends: 23 [2019-09-03 19:55:52,588 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:55:52,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:55:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:55:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 19:55:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:55:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:55:52,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-03 19:55:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:52,593 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:55:52,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:55:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:55:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:55:52,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:52,594 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:52,595 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:52,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2050111475, now seen corresponding path program 3 times [2019-09-03 19:55:52,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:52,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:52,674 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-03 19:55:52,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:52,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:55:52,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:52,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:55:52,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:52,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:52,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-09-03 19:55:52,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:55:52,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:55:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:55:52,767 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-03 19:55:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:52,812 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-03 19:55:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:55:52,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 19:55:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:52,813 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:55:52,813 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:55:52,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:55:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:55:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-03 19:55:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:55:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:55:52,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 19:55:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:52,819 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:55:52,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:55:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:55:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:55:52,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:52,820 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:52,820 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:52,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:52,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1928592087, now seen corresponding path program 4 times [2019-09-03 19:55:52,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:52,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:52,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:52,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:52,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:52,936 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-03 19:55:52,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:52,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:52,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:52,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:55:52,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:52,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-09-03 19:55:53,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:55:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:55:53,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:55:53,047 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2019-09-03 19:55:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:53,098 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-03 19:55:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:55:53,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-09-03 19:55:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:53,100 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:55:53,100 INFO L226 Difference]: Without dead ends: 22 [2019-09-03 19:55:53,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:55:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-03 19:55:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-03 19:55:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:55:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-03 19:55:53,112 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-03 19:55:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,112 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-03 19:55:53,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:55:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-03 19:55:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:55:53,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,113 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:53,113 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1112577211, now seen corresponding path program 5 times [2019-09-03 19:55:53,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:53,236 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-03 19:55:53,253 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:53,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-03 19:55:53,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:53,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 19:55:53,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2019-09-03 19:55:53,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:55:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:55:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:55:53,315 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-09-03 19:55:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:53,355 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-03 19:55:53,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:55:53,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 19:55:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:53,356 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:55:53,356 INFO L226 Difference]: Without dead ends: 24 [2019-09-03 19:55:53,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:55:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-03 19:55:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-03 19:55:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-03 19:55:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-03 19:55:53,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-03 19:55:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,362 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-03 19:55:53,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:55:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-03 19:55:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 19:55:53,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,363 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:53,363 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1393670753, now seen corresponding path program 6 times [2019-09-03 19:55:53,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:53,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:53,496 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-03 19:55:53,508 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:53,528 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:55:53,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:53,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:55:53,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-09-03 19:55:53,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:55:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:55:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:55:53,575 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2019-09-03 19:55:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:53,630 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-03 19:55:53,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:55:53,631 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-09-03 19:55:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:53,632 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:55:53,632 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:55:53,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:55:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:55:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:55:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:55:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-03 19:55:53,642 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-03 19:55:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,642 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-03 19:55:53,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:55:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-03 19:55:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:55:53,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,645 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:53,645 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash 421311101, now seen corresponding path program 7 times [2019-09-03 19:55:53,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:53,793 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-03 19:55:53,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:53,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:55:53,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:53,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:53,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2019-09-03 19:55:53,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:55:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:55:53,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:55:53,878 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-09-03 19:55:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:53,921 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-09-03 19:55:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:55:53,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-09-03 19:55:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:53,923 INFO L225 Difference]: With dead ends: 33 [2019-09-03 19:55:53,923 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 19:55:53,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:55:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 19:55:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-03 19:55:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:55:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-03 19:55:53,930 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-03 19:55:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:53,932 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-03 19:55:53,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:55:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-03 19:55:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:55:53,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:53,934 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:53,934 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:53,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:53,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2008411239, now seen corresponding path program 8 times [2019-09-03 19:55:53,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:53,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:54,076 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-03 19:55:54,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:55:54,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:54,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:54,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:55:54,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:54,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:55:54,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:54,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-03 19:55:54,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:55:54,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:55:54,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:55:54,155 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-09-03 19:55:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:54,215 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-09-03 19:55:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:55:54,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-03 19:55:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:54,217 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:55:54,217 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:55:54,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:55:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:55:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-03 19:55:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:55:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-03 19:55:54,222 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-03 19:55:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:54,222 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-03 19:55:54,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:55:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-03 19:55:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:55:54,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:54,223 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:54,224 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:54,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash -509370955, now seen corresponding path program 9 times [2019-09-03 19:55:54,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:54,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:54,329 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) [2019-09-03 19:55:54,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:54,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-03 19:55:54,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:54,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:55:54,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:54,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:54,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2019-09-03 19:55:54,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:55:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:55:54,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:55:54,427 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-09-03 19:55:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:54,472 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-09-03 19:55:54,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:55:54,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-09-03 19:55:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:54,473 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:55:54,473 INFO L226 Difference]: Without dead ends: 32 [2019-09-03 19:55:54,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:55:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-03 19:55:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-03 19:55:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:55:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-09-03 19:55:54,478 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-09-03 19:55:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:54,479 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-09-03 19:55:54,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:55:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-09-03 19:55:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 19:55:54,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:54,480 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:54,480 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1254297809, now seen corresponding path program 10 times [2019-09-03 19:55:54,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:54,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:54,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:54,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:54,631 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) [2019-09-03 19:55:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:54,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:54,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:54,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:55:54,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:54,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-09-03 19:55:54,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:55:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:55:54,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:55:54,717 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2019-09-03 19:55:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:54,768 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-09-03 19:55:54,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:55:54,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-09-03 19:55:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:54,769 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:55:54,770 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:55:54,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:55:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:55:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-03 19:55:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:55:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-09-03 19:55:54,774 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-09-03 19:55:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:54,775 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-09-03 19:55:54,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:55:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-09-03 19:55:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:55:54,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:54,776 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:54,776 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash -372101907, now seen corresponding path program 11 times [2019-09-03 19:55:54,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:54,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:54,905 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) [2019-09-03 19:55:54,922 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:54,951 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-03 19:55:54,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:54,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:55:54,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:54,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:54,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:54,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-09-03 19:55:54,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:55:54,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:55:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:55:54,994 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-09-03 19:55:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:55,047 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-09-03 19:55:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:55:55,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-03 19:55:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:55,048 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:55:55,048 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:55:55,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:55:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:55:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-03 19:55:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:55:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-09-03 19:55:55,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-09-03 19:55:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:55,055 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-09-03 19:55:55,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:55:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-09-03 19:55:55,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 19:55:55,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:55,059 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:55,059 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:55,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:55,059 INFO L82 PathProgramCache]: Analyzing trace with hash 25866761, now seen corresponding path program 12 times [2019-09-03 19:55:55,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:55,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:55,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:55,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:55,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:55,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:55,256 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-03 19:55:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:55,306 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:55:55,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:55,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:55:55,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:55,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:55,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:55,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-09-03 19:55:55,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:55:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:55:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:55:55,356 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2019-09-03 19:55:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:55,402 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-09-03 19:55:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:55:55,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-09-03 19:55:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:55,403 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:55:55,403 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 19:55:55,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:55:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 19:55:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-03 19:55:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:55:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-09-03 19:55:55,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-09-03 19:55:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:55,408 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-09-03 19:55:55,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:55:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-09-03 19:55:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-03 19:55:55,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:55,410 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:55,410 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 221667365, now seen corresponding path program 13 times [2019-09-03 19:55:55,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:55,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:55,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:55,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:55,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:55,561 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-03 19:55:55,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:55,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:55:55,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:55,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:55,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:55,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2019-09-03 19:55:55,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:55:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:55:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:55:55,669 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-09-03 19:55:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:55,715 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-09-03 19:55:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:55:55,715 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-09-03 19:55:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:55,716 INFO L225 Difference]: With dead ends: 45 [2019-09-03 19:55:55,716 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 19:55:55,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:55:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 19:55:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-03 19:55:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:55:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-09-03 19:55:55,721 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-09-03 19:55:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:55,721 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-09-03 19:55:55,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:55:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-09-03 19:55:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:55:55,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:55,722 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:55,722 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash -592513215, now seen corresponding path program 14 times [2019-09-03 19:55:55,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:55,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:55,967 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-03 19:55:55,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:56,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:56,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:56,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:55:56,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:56,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:56,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-09-03 19:55:56,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:55:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:55:56,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:55:56,089 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-09-03 19:55:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:56,137 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-09-03 19:55:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:55:56,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-09-03 19:55:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:56,138 INFO L225 Difference]: With dead ends: 47 [2019-09-03 19:55:56,138 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:55:56,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=310, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:55:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:55:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-03 19:55:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:55:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-03 19:55:56,144 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-09-03 19:55:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:56,144 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-03 19:55:56,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:55:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-03 19:55:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 19:55:56,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:56,145 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:56,145 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1336002723, now seen corresponding path program 15 times [2019-09-03 19:55:56,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:56,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:56,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:56,315 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-03 19:55:56,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:56,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-03 19:55:56,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:56,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:55:56,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:56,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:56,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2019-09-03 19:55:56,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:55:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:55:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:55:56,422 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-09-03 19:55:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:56,488 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-09-03 19:55:56,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:55:56,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-09-03 19:55:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:56,489 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:55:56,489 INFO L226 Difference]: Without dead ends: 44 [2019-09-03 19:55:56,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:55:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-03 19:55:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-03 19:55:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:55:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-09-03 19:55:56,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-09-03 19:55:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:56,497 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-09-03 19:55:56,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:55:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-09-03 19:55:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 19:55:56,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:56,499 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:56,499 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1430118521, now seen corresponding path program 16 times [2019-09-03 19:55:56,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:56,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:56,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:56,707 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-03 19:55:56,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:56,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:56,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:56,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:55:56,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:56,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:56,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:56,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-09-03 19:55:56,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:55:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:55:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:55:56,809 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2019-09-03 19:55:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:56,869 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-09-03 19:55:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:55:56,870 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2019-09-03 19:55:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:56,870 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:55:56,870 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:55:56,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:55:56,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:55:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 19:55:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:55:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-09-03 19:55:56,876 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-09-03 19:55:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:56,877 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-09-03 19:55:56,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:55:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-09-03 19:55:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:55:56,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:56,878 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:56,878 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:56,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:56,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1087877781, now seen corresponding path program 17 times [2019-09-03 19:55:56,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:56,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:56,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:56,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:56,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:57,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:57,103 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-03 19:55:57,122 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:57,163 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-03 19:55:57,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:57,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:55:57,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:57,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:57,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:57,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-03 19:55:57,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:55:57,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:55:57,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:55:57,214 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-09-03 19:55:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:57,270 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-09-03 19:55:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-03 19:55:57,271 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-09-03 19:55:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:57,271 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:55:57,271 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:55:57,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:55:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:55:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-03 19:55:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:55:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-09-03 19:55:57,277 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-09-03 19:55:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:57,277 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-09-03 19:55:57,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:55:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-09-03 19:55:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:55:57,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:57,278 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:57,278 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1387958863, now seen corresponding path program 18 times [2019-09-03 19:55:57,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:57,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:57,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:57,499 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-03 19:55:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:55:57,549 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-03 19:55:57,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:57,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:55:57,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:57,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:57,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-09-03 19:55:57,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:55:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:55:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=380, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:55:57,600 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2019-09-03 19:55:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:57,646 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-09-03 19:55:57,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:55:57,646 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2019-09-03 19:55:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:57,647 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:55:57,647 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:55:57,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=424, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:55:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:55:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-03 19:55:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:55:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-09-03 19:55:57,652 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-09-03 19:55:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:57,652 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-09-03 19:55:57,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:55:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-09-03 19:55:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:55:57,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:57,653 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:57,654 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1255091763, now seen corresponding path program 19 times [2019-09-03 19:55:57,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:57,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:57,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:57,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:57,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:57,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:57,897 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-03 19:55:57,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:57,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:55:57,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:58,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2019-09-03 19:55:58,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:55:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:55:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:55:58,008 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-09-03 19:55:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:58,061 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-09-03 19:55:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:55:58,061 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-09-03 19:55:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:58,062 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:55:58,062 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:55:58,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:55:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:55:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 19:55:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:55:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-09-03 19:55:58,065 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-09-03 19:55:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:58,066 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-09-03 19:55:58,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:55:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-09-03 19:55:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:55:58,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:58,067 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:58,067 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1876139753, now seen corresponding path program 20 times [2019-09-03 19:55:58,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:58,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:55:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:58,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:58,363 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) [2019-09-03 19:55:58,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:58,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:55:58,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:58,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 19:55:58,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:58,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:58,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:58,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-09-03 19:55:58,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:55:58,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:55:58,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:55:58,508 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2019-09-03 19:55:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:58,563 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-09-03 19:55:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-03 19:55:58,566 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-09-03 19:55:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:58,567 INFO L225 Difference]: With dead ends: 59 [2019-09-03 19:55:58,567 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:55:58,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:55:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:55:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-03 19:55:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:55:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-09-03 19:55:58,574 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-09-03 19:55:58,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:58,574 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-09-03 19:55:58,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:55:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-09-03 19:55:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 19:55:58,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:58,580 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:58,580 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash 217552133, now seen corresponding path program 21 times [2019-09-03 19:55:58,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:58,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:58,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:58,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:58,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 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-03 19:55:58,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:55:58,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-03 19:55:58,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:58,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:55:58,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2019-09-03 19:55:58,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:55:58,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:55:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=470, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:55:58,983 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-09-03 19:55:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:59,037 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-09-03 19:55:59,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:55:59,038 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-09-03 19:55:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:59,039 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:55:59,039 INFO L226 Difference]: Without dead ends: 56 [2019-09-03 19:55:59,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=292, Invalid=520, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:55:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-03 19:55:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-03 19:55:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:55:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-09-03 19:55:59,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-09-03 19:55:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:59,044 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-09-03 19:55:59,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:55:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-09-03 19:55:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-03 19:55:59,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:59,045 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:59,045 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -252283871, now seen corresponding path program 22 times [2019-09-03 19:55:59,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:59,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:59,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:59,340 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) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:55:59,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:55:59,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:55:59,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:59,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:55:59,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:59,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:59,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:59,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-09-03 19:55:59,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:55:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:55:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=502, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:55:59,470 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2019-09-03 19:55:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:55:59,541 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-09-03 19:55:59,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:55:59,542 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-09-03 19:55:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:55:59,543 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:55:59,543 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:55:59,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:55:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:55:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-03 19:55:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 19:55:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-09-03 19:55:59,550 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-09-03 19:55:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:55:59,550 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-09-03 19:55:59,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:55:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-09-03 19:55:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:55:59,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:55:59,551 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:55:59,551 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:55:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:55:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash -793117635, now seen corresponding path program 23 times [2019-09-03 19:55:59,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:55:59,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:55:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:55:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:55:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:55:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:59,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:55:59,878 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-03 19:55:59,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:55:59,939 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-03 19:55:59,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:55:59,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:55:59,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:55:59,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:55:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:55:59,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:55:59,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2019-09-03 19:55:59,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:55:59,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:55:59,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=535, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:55:59,996 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-09-03 19:56:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:00,060 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-09-03 19:56:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-03 19:56:00,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-09-03 19:56:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:00,061 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:56:00,061 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:56:00,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=589, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:56:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:56:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-09-03 19:56:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:56:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-09-03 19:56:00,065 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-09-03 19:56:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:00,066 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-09-03 19:56:00,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:56:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-09-03 19:56:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:56:00,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:00,067 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:00,067 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -843322023, now seen corresponding path program 24 times [2019-09-03 19:56:00,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:00,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:00,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:00,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:00,430 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-03 19:56:00,445 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:00,498 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-03 19:56:00,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:00,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:56:00,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:00,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:00,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:00,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-09-03 19:56:00,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:56:00,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:56:00,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=569, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:56:00,553 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2019-09-03 19:56:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:00,622 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-03 19:56:00,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:56:00,623 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2019-09-03 19:56:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:00,623 INFO L225 Difference]: With dead ends: 67 [2019-09-03 19:56:00,623 INFO L226 Difference]: Without dead ends: 62 [2019-09-03 19:56:00,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:56:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-03 19:56:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-09-03 19:56:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:56:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-09-03 19:56:00,626 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-09-03 19:56:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:00,627 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-09-03 19:56:00,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:56:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-09-03 19:56:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 19:56:00,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:00,628 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:00,628 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:00,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1845098635, now seen corresponding path program 25 times [2019-09-03 19:56:00,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:00,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:00,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:01,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:56:01,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:56:01,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:01,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2019-09-03 19:56:01,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:56:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:56:01,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=604, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:56:01,338 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-09-03 19:56:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:01,465 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-09-03 19:56:01,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:56:01,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-09-03 19:56:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:01,466 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:56:01,466 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:56:01,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:56:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:56:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-03 19:56:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:56:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-09-03 19:56:01,470 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-09-03 19:56:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:01,470 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-09-03 19:56:01,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:56:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-09-03 19:56:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 19:56:01,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:01,471 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:01,471 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1815218833, now seen corresponding path program 26 times [2019-09-03 19:56:01,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:01,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:01,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:01,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:01,925 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-03 19:56:01,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:01,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:01,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:01,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 19:56:01,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:02,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:02,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:02,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-09-03 19:56:02,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:56:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:56:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=640, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:56:02,061 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2019-09-03 19:56:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:02,113 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-09-03 19:56:02,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:56:02,113 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2019-09-03 19:56:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:02,114 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:56:02,114 INFO L226 Difference]: Without dead ends: 66 [2019-09-03 19:56:02,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=422, Invalid=700, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:56:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-03 19:56:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-03 19:56:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:56:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-09-03 19:56:02,118 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-09-03 19:56:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:02,118 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-09-03 19:56:02,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:56:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-09-03 19:56:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-03 19:56:02,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:02,119 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:02,119 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1802090157, now seen corresponding path program 27 times [2019-09-03 19:56:02,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:02,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:02,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:02,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:02,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:02,571 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) [2019-09-03 19:56:02,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:02,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-03 19:56:02,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:02,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:56:02,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:02,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:02,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:02,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 34 [2019-09-03 19:56:02,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-03 19:56:02,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-03 19:56:02,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=677, Unknown=0, NotChecked=0, Total=1122 [2019-09-03 19:56:02,753 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-09-03 19:56:02,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:02,858 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-09-03 19:56:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:56:02,859 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-09-03 19:56:02,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:02,860 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:56:02,860 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 19:56:02,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=739, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:56:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 19:56:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-03 19:56:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:56:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-09-03 19:56:02,868 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-09-03 19:56:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:02,869 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-09-03 19:56:02,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-03 19:56:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-09-03 19:56:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-03 19:56:02,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:02,870 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:02,870 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2070334409, now seen corresponding path program 28 times [2019-09-03 19:56:02,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:02,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:02,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:02,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:03,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:03,340 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) [2019-09-03 19:56:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:03,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:03,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:03,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:56:03,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:03,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:03,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:03,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-09-03 19:56:03,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:56:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:56:03,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=715, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:56:03,453 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2019-09-03 19:56:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:03,526 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-09-03 19:56:03,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:56:03,526 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2019-09-03 19:56:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:03,527 INFO L225 Difference]: With dead ends: 75 [2019-09-03 19:56:03,527 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:56:03,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=779, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:56:03,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:56:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-03 19:56:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:56:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-09-03 19:56:03,531 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-09-03 19:56:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:03,531 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-09-03 19:56:03,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:56:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-09-03 19:56:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:56:03,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:03,532 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:03,532 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2139944475, now seen corresponding path program 29 times [2019-09-03 19:56:03,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:03,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:03,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:03,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:03,951 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-03 19:56:03,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:04,029 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-03 19:56:04,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:04,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:56:04,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:04,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:04,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 36 [2019-09-03 19:56:04,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:56:04,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:56:04,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=754, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:56:04,088 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-09-03 19:56:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:04,147 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-09-03 19:56:04,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-03 19:56:04,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-09-03 19:56:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:04,149 INFO L225 Difference]: With dead ends: 77 [2019-09-03 19:56:04,149 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:56:04,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=512, Invalid=820, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:56:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:56:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 19:56:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:56:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-09-03 19:56:04,153 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-09-03 19:56:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:04,153 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-09-03 19:56:04,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:56:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-09-03 19:56:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:56:04,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:04,154 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:04,154 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1936208129, now seen corresponding path program 30 times [2019-09-03 19:56:04,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:04,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:04,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:04,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:04,592 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-03 19:56:04,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:04,677 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-03 19:56:04,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:04,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:56:04,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:04,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:04,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:04,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-09-03 19:56:04,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:56:04,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:56:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=794, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:56:04,733 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2019-09-03 19:56:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:04,808 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-09-03 19:56:04,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:56:04,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2019-09-03 19:56:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:04,810 INFO L225 Difference]: With dead ends: 79 [2019-09-03 19:56:04,810 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 19:56:04,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=544, Invalid=862, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:56:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 19:56:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-09-03 19:56:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:56:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-09-03 19:56:04,815 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-09-03 19:56:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:04,816 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-09-03 19:56:04,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:56:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-09-03 19:56:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:56:04,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:04,817 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:04,817 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2108686621, now seen corresponding path program 31 times [2019-09-03 19:56:04,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:04,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:05,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:05,329 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-03 19:56:05,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:05,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:56:05,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:05,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2019-09-03 19:56:05,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:56:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:56:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=835, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:56:05,435 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-09-03 19:56:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:05,494 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-09-03 19:56:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:56:05,494 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-09-03 19:56:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:05,495 INFO L225 Difference]: With dead ends: 81 [2019-09-03 19:56:05,495 INFO L226 Difference]: Without dead ends: 76 [2019-09-03 19:56:05,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=577, Invalid=905, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:56:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-03 19:56:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-03 19:56:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 19:56:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-09-03 19:56:05,500 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-09-03 19:56:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:05,500 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-09-03 19:56:05,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:56:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-09-03 19:56:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:56:05,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:05,501 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:05,501 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash 356792889, now seen corresponding path program 32 times [2019-09-03 19:56:05,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:05,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:05,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:05,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:05,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:06,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:06,059 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-03 19:56:06,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:06,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:06,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:06,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:56:06,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:06,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:06,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:06,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-09-03 19:56:06,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:56:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:56:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=877, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:56:06,181 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2019-09-03 19:56:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:06,265 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-09-03 19:56:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:56:06,266 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2019-09-03 19:56:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:06,267 INFO L225 Difference]: With dead ends: 83 [2019-09-03 19:56:06,267 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 19:56:06,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=611, Invalid=949, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:56:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 19:56:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 19:56:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 19:56:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-09-03 19:56:06,271 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-09-03 19:56:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:06,271 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-09-03 19:56:06,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:56:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-09-03 19:56:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-03 19:56:06,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:06,272 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:06,272 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash 414096469, now seen corresponding path program 33 times [2019-09-03 19:56:06,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:06,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:07,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:07,038 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-03 19:56:07,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:07,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-03 19:56:07,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:07,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:56:07,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:07,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:56:07,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:07,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 40 [2019-09-03 19:56:07,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:56:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:56:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=920, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:56:07,217 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-09-03 19:56:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:07,312 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-09-03 19:56:07,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:56:07,313 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-09-03 19:56:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:07,314 INFO L225 Difference]: With dead ends: 85 [2019-09-03 19:56:07,314 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:56:07,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:56:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:56:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 19:56:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:56:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-09-03 19:56:07,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-09-03 19:56:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:07,321 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-09-03 19:56:07,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:56:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-09-03 19:56:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:56:07,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:07,322 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:07,322 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -351737999, now seen corresponding path program 34 times [2019-09-03 19:56:07,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:07,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:07,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:08,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:08,111 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) [2019-09-03 19:56:08,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:08,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:08,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:08,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:56:08,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:08,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:08,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:08,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-09-03 19:56:08,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:56:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:56:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=964, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:56:08,269 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2019-09-03 19:56:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:08,358 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-09-03 19:56:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:56:08,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2019-09-03 19:56:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:08,359 INFO L225 Difference]: With dead ends: 87 [2019-09-03 19:56:08,359 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:56:08,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=682, Invalid=1040, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:56:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:56:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-03 19:56:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 19:56:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-09-03 19:56:08,365 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-09-03 19:56:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:08,365 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-09-03 19:56:08,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:56:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-09-03 19:56:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:56:08,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:08,366 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:08,366 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1879254131, now seen corresponding path program 35 times [2019-09-03 19:56:08,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:08,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:08,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:09,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:09,004 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-03 19:56:09,014 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:09,090 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-03 19:56:09,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:09,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:56:09,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:09,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:09,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-03 19:56:09,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:56:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:56:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1009, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:56:09,155 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-09-03 19:56:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:09,227 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-09-03 19:56:09,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:56:09,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-09-03 19:56:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:09,228 INFO L225 Difference]: With dead ends: 89 [2019-09-03 19:56:09,228 INFO L226 Difference]: Without dead ends: 84 [2019-09-03 19:56:09,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=719, Invalid=1087, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:56:09,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-03 19:56:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-03 19:56:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:56:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-09-03 19:56:09,232 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-09-03 19:56:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:09,233 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-09-03 19:56:09,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:56:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-09-03 19:56:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:56:09,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:09,234 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:09,234 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash -943441751, now seen corresponding path program 36 times [2019-09-03 19:56:09,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:09,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:09,887 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-03 19:56:09,907 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:09,987 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-03 19:56:09,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:09,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:56:09,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:09,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:10,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:10,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-09-03 19:56:10,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:56:10,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:56:10,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=751, Invalid=1055, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:56:10,054 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2019-09-03 19:56:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:10,152 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-09-03 19:56:10,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:56:10,156 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2019-09-03 19:56:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:10,157 INFO L225 Difference]: With dead ends: 91 [2019-09-03 19:56:10,157 INFO L226 Difference]: Without dead ends: 86 [2019-09-03 19:56:10,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=757, Invalid=1135, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:56:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-03 19:56:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-03 19:56:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:56:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-09-03 19:56:10,161 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-09-03 19:56:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:10,161 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-09-03 19:56:10,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:56:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-09-03 19:56:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:56:10,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:10,162 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:10,162 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 724090565, now seen corresponding path program 37 times [2019-09-03 19:56:10,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:10,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:10,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:10,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:10,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:10,805 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-03 19:56:10,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:10,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:56:10,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:10,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:10,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:10,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 44 [2019-09-03 19:56:10,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:56:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:56:10,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=790, Invalid=1102, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:56:10,927 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-09-03 19:56:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:11,018 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-09-03 19:56:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:56:11,018 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-09-03 19:56:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:11,019 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:56:11,019 INFO L226 Difference]: Without dead ends: 88 [2019-09-03 19:56:11,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1184, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:56:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-03 19:56:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-03 19:56:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:56:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-09-03 19:56:11,024 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-09-03 19:56:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:11,024 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-09-03 19:56:11,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:56:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-09-03 19:56:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:56:11,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:11,025 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:11,025 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1199844833, now seen corresponding path program 38 times [2019-09-03 19:56:11,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:11,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:11,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:11,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:11,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:11,778 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-03 19:56:11,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:11,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:11,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:11,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:56:11,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:11,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:11,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-09-03 19:56:11,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:56:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:56:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1150, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:56:11,933 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2019-09-03 19:56:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:12,033 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-09-03 19:56:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:56:12,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2019-09-03 19:56:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:12,034 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:56:12,034 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 19:56:12,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=836, Invalid=1234, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:56:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 19:56:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-03 19:56:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:56:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-09-03 19:56:12,040 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-09-03 19:56:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:12,040 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-09-03 19:56:12,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:56:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-09-03 19:56:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:56:12,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:12,041 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:12,041 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:12,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1161804291, now seen corresponding path program 39 times [2019-09-03 19:56:12,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:12,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:12,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:12,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:12,719 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-03 19:56:12,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:12,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-03 19:56:12,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:12,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:56:12,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:12,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:12,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:12,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 46 [2019-09-03 19:56:12,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-03 19:56:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-03 19:56:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=1199, Unknown=0, NotChecked=0, Total=2070 [2019-09-03 19:56:12,878 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-09-03 19:56:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:12,954 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-09-03 19:56:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:56:12,954 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-09-03 19:56:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:12,955 INFO L225 Difference]: With dead ends: 97 [2019-09-03 19:56:12,955 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 19:56:12,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:56:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 19:56:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-03 19:56:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:56:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-09-03 19:56:12,960 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-09-03 19:56:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:12,960 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-09-03 19:56:12,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-03 19:56:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-09-03 19:56:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-03 19:56:12,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:12,961 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:12,961 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1331087129, now seen corresponding path program 40 times [2019-09-03 19:56:12,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:12,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:12,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:12,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:12,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:13,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:13,719 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-03 19:56:13,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:13,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:13,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:13,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:56:13,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:13,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:13,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:13,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-09-03 19:56:13,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:56:13,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:56:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=913, Invalid=1249, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:56:13,861 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2019-09-03 19:56:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:13,965 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-09-03 19:56:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:56:13,966 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2019-09-03 19:56:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:13,967 INFO L225 Difference]: With dead ends: 99 [2019-09-03 19:56:13,967 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:56:13,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=919, Invalid=1337, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:56:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:56:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 19:56:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:56:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-09-03 19:56:13,971 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-09-03 19:56:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:13,971 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-09-03 19:56:13,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:56:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-09-03 19:56:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:56:13,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:13,972 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:13,973 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash 407990581, now seen corresponding path program 41 times [2019-09-03 19:56:13,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:13,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:13,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:14,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:14,766 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-03 19:56:14,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:14,890 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-03 19:56:14,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:14,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:56:14,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:14,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:14,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:14,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 48 [2019-09-03 19:56:14,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:56:14,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:56:14,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=1300, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:56:14,951 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-09-03 19:56:15,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:15,024 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-09-03 19:56:15,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-03 19:56:15,025 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-09-03 19:56:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:15,026 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:56:15,026 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:56:15,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=962, Invalid=1390, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:56:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:56:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-09-03 19:56:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:56:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-09-03 19:56:15,030 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-09-03 19:56:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:15,031 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-09-03 19:56:15,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:56:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-09-03 19:56:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:56:15,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:15,031 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:15,032 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:15,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1924529071, now seen corresponding path program 42 times [2019-09-03 19:56:15,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:15,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:15,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:15,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:15,782 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-03 19:56:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:15,885 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-03 19:56:15,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:15,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-03 19:56:15,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:15,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-03 19:56:15,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-03 19:56:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-03 19:56:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1000, Invalid=1352, Unknown=0, NotChecked=0, Total=2352 [2019-09-03 19:56:15,988 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2019-09-03 19:56:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:16,099 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-09-03 19:56:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:56:16,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2019-09-03 19:56:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:16,101 INFO L225 Difference]: With dead ends: 103 [2019-09-03 19:56:16,101 INFO L226 Difference]: Without dead ends: 98 [2019-09-03 19:56:16,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1006, Invalid=1444, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:56:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-03 19:56:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-03 19:56:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 19:56:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-09-03 19:56:16,106 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-09-03 19:56:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:16,107 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-09-03 19:56:16,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-03 19:56:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-09-03 19:56:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:56:16,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:16,109 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:16,109 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1502986131, now seen corresponding path program 43 times [2019-09-03 19:56:16,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:16,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:16,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:16,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:17,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:17,382 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-03 19:56:17,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:17,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-03 19:56:17,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:17,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:17,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 50 [2019-09-03 19:56:17,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-03 19:56:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-03 19:56:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1045, Invalid=1405, Unknown=0, NotChecked=0, Total=2450 [2019-09-03 19:56:17,550 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-09-03 19:56:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:17,655 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-09-03 19:56:17,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:56:17,655 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-09-03 19:56:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:17,658 INFO L225 Difference]: With dead ends: 105 [2019-09-03 19:56:17,659 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 19:56:17,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1051, Invalid=1499, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:56:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 19:56:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-09-03 19:56:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:56:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-09-03 19:56:17,663 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-09-03 19:56:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:17,663 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-09-03 19:56:17,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-03 19:56:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-09-03 19:56:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 19:56:17,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:17,664 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:17,664 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:17,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash -127146615, now seen corresponding path program 44 times [2019-09-03 19:56:17,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:17,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:17,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:18,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:18,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:56:18,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:19,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:19,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:19,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:56:19,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:19,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:19,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:19,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-09-03 19:56:19,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-03 19:56:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-03 19:56:19,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1091, Invalid=1459, Unknown=0, NotChecked=0, Total=2550 [2019-09-03 19:56:19,104 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2019-09-03 19:56:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:19,241 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-09-03 19:56:19,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-03 19:56:19,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2019-09-03 19:56:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:19,244 INFO L225 Difference]: With dead ends: 107 [2019-09-03 19:56:19,244 INFO L226 Difference]: Without dead ends: 102 [2019-09-03 19:56:19,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1097, Invalid=1555, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:56:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-03 19:56:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-09-03 19:56:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 19:56:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-09-03 19:56:19,250 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-09-03 19:56:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:19,251 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-09-03 19:56:19,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-03 19:56:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-09-03 19:56:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-03 19:56:19,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:19,253 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:19,253 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash -795298907, now seen corresponding path program 45 times [2019-09-03 19:56:19,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:19,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:19,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:20,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:20,915 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-03 19:56:20,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:21,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-03 19:56:21,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:21,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:56:21,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:21,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:21,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:21,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 52 [2019-09-03 19:56:21,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:56:21,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:56:21,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=1514, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:56:21,217 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-09-03 19:56:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:21,332 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-09-03 19:56:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:56:21,332 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-09-03 19:56:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:21,333 INFO L225 Difference]: With dead ends: 109 [2019-09-03 19:56:21,333 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:56:21,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1144, Invalid=1612, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:56:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:56:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-09-03 19:56:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:56:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-09-03 19:56:21,338 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-09-03 19:56:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:21,339 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-09-03 19:56:21,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:56:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-09-03 19:56:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-03 19:56:21,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:21,340 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:21,340 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1355442881, now seen corresponding path program 46 times [2019-09-03 19:56:21,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:21,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:22,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:22,475 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-03 19:56:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:22,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:22,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:22,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-03 19:56:22,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:22,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:22,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:22,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-09-03 19:56:22,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-03 19:56:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-03 19:56:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1570, Unknown=0, NotChecked=0, Total=2756 [2019-09-03 19:56:22,625 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2019-09-03 19:56:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:22,745 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-09-03 19:56:22,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-03 19:56:22,746 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2019-09-03 19:56:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:22,747 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:56:22,747 INFO L226 Difference]: Without dead ends: 106 [2019-09-03 19:56:22,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1192, Invalid=1670, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:56:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-03 19:56:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-09-03 19:56:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 19:56:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-09-03 19:56:22,751 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-09-03 19:56:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:22,751 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-09-03 19:56:22,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-03 19:56:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-09-03 19:56:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-03 19:56:22,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:22,752 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:22,753 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:22,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1955935523, now seen corresponding path program 47 times [2019-09-03 19:56:22,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:22,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:22,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:23,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:23,703 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-03 19:56:23,716 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:23,823 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-03 19:56:23,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:23,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-03 19:56:23,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:23,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:23,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 54 [2019-09-03 19:56:23,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-03 19:56:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-03 19:56:23,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1235, Invalid=1627, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:56:23,931 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-09-03 19:56:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:24,019 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-09-03 19:56:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:56:24,019 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-09-03 19:56:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:24,020 INFO L225 Difference]: With dead ends: 113 [2019-09-03 19:56:24,021 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 19:56:24,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1241, Invalid=1729, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:56:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 19:56:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-03 19:56:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 19:56:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-09-03 19:56:24,026 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-09-03 19:56:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:24,026 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-09-03 19:56:24,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-03 19:56:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-09-03 19:56:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 19:56:24,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:24,027 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:24,027 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1619815431, now seen corresponding path program 48 times [2019-09-03 19:56:24,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:24,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:24,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:24,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:24,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:24,995 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-03 19:56:25,005 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:25,145 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-03 19:56:25,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:25,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 19:56:25,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:25,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:25,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 55 [2019-09-03 19:56:25,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-03 19:56:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-03 19:56:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1285, Invalid=1685, Unknown=0, NotChecked=0, Total=2970 [2019-09-03 19:56:25,259 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2019-09-03 19:56:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:25,369 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-09-03 19:56:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-03 19:56:25,370 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2019-09-03 19:56:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:25,371 INFO L225 Difference]: With dead ends: 115 [2019-09-03 19:56:25,371 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:56:25,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1291, Invalid=1789, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:56:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:56:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-09-03 19:56:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-03 19:56:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-09-03 19:56:25,376 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-09-03 19:56:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:25,376 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-09-03 19:56:25,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-03 19:56:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-09-03 19:56:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:56:25,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:25,378 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:25,378 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -730954219, now seen corresponding path program 49 times [2019-09-03 19:56:25,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:25,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:26,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:26,834 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-03 19:56:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:26,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-03 19:56:26,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 56 [2019-09-03 19:56:26,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-03 19:56:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-03 19:56:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=1744, Unknown=0, NotChecked=0, Total=3080 [2019-09-03 19:56:26,996 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-09-03 19:56:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:27,115 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-09-03 19:56:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-03 19:56:27,116 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-09-03 19:56:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:27,117 INFO L225 Difference]: With dead ends: 117 [2019-09-03 19:56:27,117 INFO L226 Difference]: Without dead ends: 112 [2019-09-03 19:56:27,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1342, Invalid=1850, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:56:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-03 19:56:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-09-03 19:56:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:56:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-09-03 19:56:27,122 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-09-03 19:56:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:27,122 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-09-03 19:56:27,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-03 19:56:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-09-03 19:56:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:56:27,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:27,123 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:27,124 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:27,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1233821391, now seen corresponding path program 50 times [2019-09-03 19:56:27,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:27,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:27,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:27,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:28,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:28,220 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-03 19:56:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:28,300 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:28,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:28,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 19:56:28,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:28,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:28,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-03 19:56:28,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:56:28,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:56:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1388, Invalid=1804, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:56:28,406 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2019-09-03 19:56:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:28,526 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-09-03 19:56:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:56:28,526 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2019-09-03 19:56:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:28,527 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:56:28,528 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:56:28,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1394, Invalid=1912, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:56:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:56:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-09-03 19:56:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:56:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-09-03 19:56:28,532 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-09-03 19:56:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:28,532 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-09-03 19:56:28,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:56:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-09-03 19:56:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-03 19:56:28,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:28,533 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:28,534 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:28,534 INFO L82 PathProgramCache]: Analyzing trace with hash 842130765, now seen corresponding path program 51 times [2019-09-03 19:56:28,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:28,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:29,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:29,594 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-03 19:56:29,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:29,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-03 19:56:29,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:29,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-03 19:56:29,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:29,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (52)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:29,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 58 [2019-09-03 19:56:29,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-03 19:56:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-03 19:56:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=1865, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:56:29,823 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-09-03 19:56:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:29,949 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-09-03 19:56:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-03 19:56:29,950 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-09-03 19:56:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:29,951 INFO L225 Difference]: With dead ends: 121 [2019-09-03 19:56:29,951 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 19:56:29,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1447, Invalid=1975, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:56:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 19:56:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-09-03 19:56:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 19:56:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-09-03 19:56:29,955 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-09-03 19:56:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:29,956 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-09-03 19:56:29,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-03 19:56:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-09-03 19:56:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-03 19:56:29,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:29,957 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:29,957 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:29,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1327639959, now seen corresponding path program 52 times [2019-09-03 19:56:29,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:29,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:31,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:31,028 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-03 19:56:31,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:31,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:31,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:31,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-03 19:56:31,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:31,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:31,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:31,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-03 19:56:31,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-03 19:56:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-03 19:56:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1495, Invalid=1927, Unknown=0, NotChecked=0, Total=3422 [2019-09-03 19:56:31,199 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2019-09-03 19:56:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:31,344 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-09-03 19:56:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-03 19:56:31,344 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2019-09-03 19:56:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:31,345 INFO L225 Difference]: With dead ends: 123 [2019-09-03 19:56:31,346 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:56:31,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1501, Invalid=2039, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:56:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:56:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-03 19:56:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 19:56:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-09-03 19:56:31,350 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-09-03 19:56:31,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:31,350 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-09-03 19:56:31,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-03 19:56:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-09-03 19:56:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-03 19:56:31,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:31,351 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:31,351 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:31,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 876800133, now seen corresponding path program 53 times [2019-09-03 19:56:31,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:31,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:31,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:31,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:32,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:32,576 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) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:32,708 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-03 19:56:32,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:32,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-03 19:56:32,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:32,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (54)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:32,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:32,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 60 [2019-09-03 19:56:32,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-03 19:56:32,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-03 19:56:32,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1550, Invalid=1990, Unknown=0, NotChecked=0, Total=3540 [2019-09-03 19:56:32,797 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-09-03 19:56:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:32,930 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-09-03 19:56:32,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-03 19:56:32,931 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-09-03 19:56:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:32,931 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:56:32,932 INFO L226 Difference]: Without dead ends: 120 [2019-09-03 19:56:32,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1556, Invalid=2104, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:56:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-03 19:56:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-03 19:56:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 19:56:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-09-03 19:56:32,936 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-09-03 19:56:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:32,936 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-09-03 19:56:32,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-03 19:56:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-09-03 19:56:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-03 19:56:32,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:32,937 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:32,937 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1924851617, now seen corresponding path program 54 times [2019-09-03 19:56:32,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:32,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:34,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:34,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 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-03 19:56:34,123 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:34,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-03 19:56:34,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:34,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-03 19:56:34,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:34,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:34,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-09-03 19:56:34,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-03 19:56:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-03 19:56:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1606, Invalid=2054, Unknown=0, NotChecked=0, Total=3660 [2019-09-03 19:56:34,316 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2019-09-03 19:56:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:34,450 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-09-03 19:56:34,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-03 19:56:34,451 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2019-09-03 19:56:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:34,452 INFO L225 Difference]: With dead ends: 127 [2019-09-03 19:56:34,452 INFO L226 Difference]: Without dead ends: 122 [2019-09-03 19:56:34,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1612, Invalid=2170, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:56:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-03 19:56:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-09-03 19:56:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-03 19:56:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-09-03 19:56:34,457 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-09-03 19:56:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:34,457 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-09-03 19:56:34,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-03 19:56:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-09-03 19:56:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-03 19:56:34,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:34,458 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:34,458 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:34,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash -214986819, now seen corresponding path program 55 times [2019-09-03 19:56:34,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:35,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:35,667 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-03 19:56:35,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:35,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-03 19:56:35,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:35,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 62 [2019-09-03 19:56:35,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-03 19:56:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-03 19:56:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=2119, Unknown=0, NotChecked=0, Total=3782 [2019-09-03 19:56:35,842 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-09-03 19:56:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:35,978 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-09-03 19:56:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-03 19:56:35,978 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-09-03 19:56:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:35,979 INFO L225 Difference]: With dead ends: 129 [2019-09-03 19:56:35,979 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 19:56:35,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1669, Invalid=2237, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:56:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 19:56:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-09-03 19:56:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-03 19:56:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-09-03 19:56:35,984 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-09-03 19:56:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:35,984 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-09-03 19:56:35,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-03 19:56:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-09-03 19:56:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-03 19:56:35,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:35,985 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:35,986 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash 689610969, now seen corresponding path program 56 times [2019-09-03 19:56:35,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:35,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:35,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:37,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:37,325 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-03 19:56:37,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:37,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:37,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:37,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 19:56:37,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:37,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:37,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-09-03 19:56:37,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 19:56:37,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 19:56:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=2185, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 19:56:37,519 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2019-09-03 19:56:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:37,657 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-09-03 19:56:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-03 19:56:37,658 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2019-09-03 19:56:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:37,659 INFO L225 Difference]: With dead ends: 131 [2019-09-03 19:56:37,659 INFO L226 Difference]: Without dead ends: 126 [2019-09-03 19:56:37,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1727, Invalid=2305, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:56:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-03 19:56:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-03 19:56:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-03 19:56:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-09-03 19:56:37,664 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-09-03 19:56:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:37,665 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-09-03 19:56:37,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 19:56:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-09-03 19:56:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-03 19:56:37,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:37,666 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:37,666 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:37,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1870275851, now seen corresponding path program 57 times [2019-09-03 19:56:37,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:37,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:37,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:37,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:39,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:39,327 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-03 19:56:39,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:39,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-09-03 19:56:39,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:39,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-03 19:56:39,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:39,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (58)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:39,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:39,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 64 [2019-09-03 19:56:39,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-03 19:56:39,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-03 19:56:39,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1780, Invalid=2252, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 19:56:39,585 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-09-03 19:56:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:39,693 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-09-03 19:56:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-03 19:56:39,694 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-09-03 19:56:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:39,695 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:56:39,695 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 19:56:39,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1786, Invalid=2374, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:56:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 19:56:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 19:56:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 19:56:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-09-03 19:56:39,701 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-09-03 19:56:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:39,702 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-09-03 19:56:39,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-03 19:56:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-09-03 19:56:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-03 19:56:39,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:39,703 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:39,703 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash -905249263, now seen corresponding path program 58 times [2019-09-03 19:56:39,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:39,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:39,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:39,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:39,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:41,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:41,006 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-03 19:56:41,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:41,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:41,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:41,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-03 19:56:41,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:41,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:41,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:41,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 65 [2019-09-03 19:56:41,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-03 19:56:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-03 19:56:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=2320, Unknown=0, NotChecked=0, Total=4160 [2019-09-03 19:56:41,249 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2019-09-03 19:56:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:41,484 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-09-03 19:56:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 19:56:41,485 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2019-09-03 19:56:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:41,486 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:56:41,487 INFO L226 Difference]: Without dead ends: 130 [2019-09-03 19:56:41,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1846, Invalid=2444, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:56:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-03 19:56:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-09-03 19:56:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-03 19:56:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-09-03 19:56:41,493 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-09-03 19:56:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:41,494 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-09-03 19:56:41,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-03 19:56:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-09-03 19:56:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-03 19:56:41,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:41,495 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:41,495 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:41,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1227634131, now seen corresponding path program 59 times [2019-09-03 19:56:41,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:41,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:41,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:42,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:42,968 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-03 19:56:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:43,140 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-09-03 19:56:43,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:43,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-03 19:56:43,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:43,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 66 [2019-09-03 19:56:43,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-03 19:56:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-03 19:56:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1901, Invalid=2389, Unknown=0, NotChecked=0, Total=4290 [2019-09-03 19:56:43,246 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-09-03 19:56:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:43,397 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-09-03 19:56:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-03 19:56:43,398 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-09-03 19:56:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:43,399 INFO L225 Difference]: With dead ends: 137 [2019-09-03 19:56:43,399 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 19:56:43,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1907, Invalid=2515, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:56:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 19:56:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2019-09-03 19:56:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-09-03 19:56:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-09-03 19:56:43,403 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2019-09-03 19:56:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:43,404 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-09-03 19:56:43,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-03 19:56:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-09-03 19:56:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-03 19:56:43,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:43,405 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:43,405 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1801846967, now seen corresponding path program 60 times [2019-09-03 19:56:43,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:43,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:43,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:43,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:44,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:44,987 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-03 19:56:44,998 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:45,141 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-03 19:56:45,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:45,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-03 19:56:45,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:45,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:45,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 67 [2019-09-03 19:56:45,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-03 19:56:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-03 19:56:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1963, Invalid=2459, Unknown=0, NotChecked=0, Total=4422 [2019-09-03 19:56:45,237 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2019-09-03 19:56:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:45,388 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-09-03 19:56:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-03 19:56:45,388 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2019-09-03 19:56:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:45,389 INFO L225 Difference]: With dead ends: 139 [2019-09-03 19:56:45,390 INFO L226 Difference]: Without dead ends: 134 [2019-09-03 19:56:45,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1969, Invalid=2587, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:56:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-03 19:56:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-09-03 19:56:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-03 19:56:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-09-03 19:56:45,394 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2019-09-03 19:56:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:45,394 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-09-03 19:56:45,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-03 19:56:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-09-03 19:56:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-03 19:56:45,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:45,395 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:45,395 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 430398821, now seen corresponding path program 61 times [2019-09-03 19:56:45,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:45,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:46,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:46,927 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-03 19:56:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-03 19:56:47,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:47,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:47,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 68 [2019-09-03 19:56:47,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:56:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:56:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=2530, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:56:47,167 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-09-03 19:56:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:47,321 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-09-03 19:56:47,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-03 19:56:47,321 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-09-03 19:56:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:47,323 INFO L225 Difference]: With dead ends: 141 [2019-09-03 19:56:47,323 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 19:56:47,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2032, Invalid=2660, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:56:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 19:56:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-03 19:56:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-03 19:56:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2019-09-03 19:56:47,327 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2019-09-03 19:56:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:47,327 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2019-09-03 19:56:47,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:56:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2019-09-03 19:56:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-03 19:56:47,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:47,328 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:47,328 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:47,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1865046911, now seen corresponding path program 62 times [2019-09-03 19:56:47,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:47,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:47,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:47,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:48,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:48,778 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) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:48,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:56:48,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:56:48,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:48,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-03 19:56:48,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:48,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:48,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 69 [2019-09-03 19:56:48,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-03 19:56:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-03 19:56:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2090, Invalid=2602, Unknown=0, NotChecked=0, Total=4692 [2019-09-03 19:56:48,993 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2019-09-03 19:56:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:49,147 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-09-03 19:56:49,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-03 19:56:49,148 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2019-09-03 19:56:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:49,149 INFO L225 Difference]: With dead ends: 143 [2019-09-03 19:56:49,149 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 19:56:49,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2096, Invalid=2734, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:56:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 19:56:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-03 19:56:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-03 19:56:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-09-03 19:56:49,154 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2019-09-03 19:56:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:49,154 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-09-03 19:56:49,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-03 19:56:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-09-03 19:56:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-03 19:56:49,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:49,156 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:49,156 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash -175205219, now seen corresponding path program 63 times [2019-09-03 19:56:49,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:49,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:49,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:49,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:50,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:50,679 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-03 19:56:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:56:50,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-09-03 19:56:50,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:50,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-03 19:56:50,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:50,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:50,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 70 [2019-09-03 19:56:50,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-03 19:56:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-03 19:56:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2155, Invalid=2675, Unknown=0, NotChecked=0, Total=4830 [2019-09-03 19:56:50,938 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-09-03 19:56:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:51,088 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-09-03 19:56:51,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:56:51,089 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-09-03 19:56:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:51,089 INFO L225 Difference]: With dead ends: 145 [2019-09-03 19:56:51,089 INFO L226 Difference]: Without dead ends: 140 [2019-09-03 19:56:51,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2161, Invalid=2809, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:56:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-03 19:56:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-09-03 19:56:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-03 19:56:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-09-03 19:56:51,094 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2019-09-03 19:56:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:51,094 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-09-03 19:56:51,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-03 19:56:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-09-03 19:56:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-03 19:56:51,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:51,095 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:51,095 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash 265022905, now seen corresponding path program 64 times [2019-09-03 19:56:51,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:51,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:51,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:52,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:52,667 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) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:56:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:56:52,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:56:52,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:52,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-03 19:56:52,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (65)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:52,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:52,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 71 [2019-09-03 19:56:52,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-03 19:56:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-03 19:56:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2221, Invalid=2749, Unknown=0, NotChecked=0, Total=4970 [2019-09-03 19:56:52,918 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2019-09-03 19:56:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:53,107 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-09-03 19:56:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-03 19:56:53,108 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2019-09-03 19:56:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:53,109 INFO L225 Difference]: With dead ends: 147 [2019-09-03 19:56:53,109 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 19:56:53,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2227, Invalid=2885, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:56:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 19:56:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-09-03 19:56:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-03 19:56:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-09-03 19:56:53,114 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2019-09-03 19:56:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:53,114 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-09-03 19:56:53,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-03 19:56:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-09-03 19:56:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-03 19:56:53,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:53,116 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:53,116 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1877512235, now seen corresponding path program 65 times [2019-09-03 19:56:53,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:53,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:53,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:53,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:53,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:54,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:54,719 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-03 19:56:54,728 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:56:54,896 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-09-03 19:56:54,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:54,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-03 19:56:54,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:54,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (66)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:56:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 72 [2019-09-03 19:56:55,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:56:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:56:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2288, Invalid=2824, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:56:55,026 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-09-03 19:56:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:55,209 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-09-03 19:56:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-03 19:56:55,209 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-09-03 19:56:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:55,210 INFO L225 Difference]: With dead ends: 149 [2019-09-03 19:56:55,211 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:56:55,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2294, Invalid=2962, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:56:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:56:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 19:56:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 19:56:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2019-09-03 19:56:55,216 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2019-09-03 19:56:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:55,216 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2019-09-03 19:56:55,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:56:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2019-09-03 19:56:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 19:56:55,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:55,217 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:55,217 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 730520305, now seen corresponding path program 66 times [2019-09-03 19:56:55,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:55,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:55,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:56,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:56,910 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-03 19:56:56,920 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:56:57,085 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-09-03 19:56:57,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:56:57,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 73 conjunts are in the unsatisfiable core [2019-09-03 19:56:57,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:57,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:57,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:57,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 73 [2019-09-03 19:56:57,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-03 19:56:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-03 19:56:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2356, Invalid=2900, Unknown=0, NotChecked=0, Total=5256 [2019-09-03 19:56:57,165 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2019-09-03 19:56:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:57,296 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-09-03 19:56:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-03 19:56:57,296 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2019-09-03 19:56:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:57,297 INFO L225 Difference]: With dead ends: 151 [2019-09-03 19:56:57,297 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 19:56:57,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2362, Invalid=3040, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:56:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 19:56:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-03 19:56:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 19:56:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-09-03 19:56:57,301 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2019-09-03 19:56:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:57,301 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-09-03 19:56:57,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-03 19:56:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-09-03 19:56:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:56:57,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:57,302 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:57,303 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1211109619, now seen corresponding path program 67 times [2019-09-03 19:56:57,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:57,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:57,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:56:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:58,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:56:58,983 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-03 19:56:58,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:56:59,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-03 19:56:59,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:56:59,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:56:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:56:59,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:56:59,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 74 [2019-09-03 19:56:59,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-03 19:56:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-03 19:56:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-09-03 19:56:59,169 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-09-03 19:56:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:56:59,331 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-09-03 19:56:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 19:56:59,331 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-09-03 19:56:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:56:59,332 INFO L225 Difference]: With dead ends: 153 [2019-09-03 19:56:59,332 INFO L226 Difference]: Without dead ends: 148 [2019-09-03 19:56:59,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2431, Invalid=3119, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:56:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-03 19:56:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-09-03 19:56:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 19:56:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-09-03 19:56:59,337 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2019-09-03 19:56:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:56:59,337 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-09-03 19:56:59,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-03 19:56:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-09-03 19:56:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 19:56:59,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:56:59,338 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:56:59,339 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:56:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:56:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1193307177, now seen corresponding path program 68 times [2019-09-03 19:56:59,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:56:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:56:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:56:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:56:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:01,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:01,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-03 19:57:01,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:01,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:01,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:01,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-03 19:57:01,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:01,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:01,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:01,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 75 [2019-09-03 19:57:01,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-03 19:57:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-03 19:57:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2495, Invalid=3055, Unknown=0, NotChecked=0, Total=5550 [2019-09-03 19:57:01,299 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2019-09-03 19:57:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:01,503 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-09-03 19:57:01,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-03 19:57:01,504 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2019-09-03 19:57:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:01,505 INFO L225 Difference]: With dead ends: 155 [2019-09-03 19:57:01,506 INFO L226 Difference]: Without dead ends: 150 [2019-09-03 19:57:01,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2501, Invalid=3199, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:57:01,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-03 19:57:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-09-03 19:57:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-03 19:57:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-09-03 19:57:01,511 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2019-09-03 19:57:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:01,511 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-09-03 19:57:01,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-03 19:57:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-09-03 19:57:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-03 19:57:01,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:01,512 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:01,512 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1145442885, now seen corresponding path program 69 times [2019-09-03 19:57:01,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:01,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:01,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:03,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:03,299 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-03 19:57:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:03,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-09-03 19:57:03,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:03,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-03 19:57:03,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:03,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:03,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:03,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 76 [2019-09-03 19:57:03,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-03 19:57:03,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-03 19:57:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2566, Invalid=3134, Unknown=0, NotChecked=0, Total=5700 [2019-09-03 19:57:03,599 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-09-03 19:57:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:03,813 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-09-03 19:57:03,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-09-03 19:57:03,813 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-09-03 19:57:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:03,815 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:57:03,815 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:57:03,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2572, Invalid=3280, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:57:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:57:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 19:57:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 19:57:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-09-03 19:57:03,819 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2019-09-03 19:57:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:03,819 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-09-03 19:57:03,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-03 19:57:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-09-03 19:57:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 19:57:03,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:03,820 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:03,820 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1902468767, now seen corresponding path program 70 times [2019-09-03 19:57:03,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:03,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:03,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:06,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:06,379 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-03 19:57:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:06,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:06,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:06,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 77 conjunts are in the unsatisfiable core [2019-09-03 19:57:06,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:06,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:06,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:06,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 77 [2019-09-03 19:57:06,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-03 19:57:06,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-03 19:57:06,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2638, Invalid=3214, Unknown=0, NotChecked=0, Total=5852 [2019-09-03 19:57:06,585 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2019-09-03 19:57:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:06,745 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-09-03 19:57:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-03 19:57:06,746 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2019-09-03 19:57:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:06,747 INFO L225 Difference]: With dead ends: 159 [2019-09-03 19:57:06,747 INFO L226 Difference]: Without dead ends: 154 [2019-09-03 19:57:06,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2644, Invalid=3362, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:57:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-03 19:57:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-03 19:57:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 19:57:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-09-03 19:57:06,751 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2019-09-03 19:57:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:06,751 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-09-03 19:57:06,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-03 19:57:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-09-03 19:57:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 19:57:06,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:06,752 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:06,752 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:06,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1777870467, now seen corresponding path program 71 times [2019-09-03 19:57:06,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:06,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:06,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:06,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:08,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:08,683 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-03 19:57:08,693 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:08,868 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-09-03 19:57:08,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:08,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-03 19:57:08,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:08,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:08,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:08,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 78 [2019-09-03 19:57:08,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-03 19:57:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-03 19:57:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=3295, Unknown=0, NotChecked=0, Total=6006 [2019-09-03 19:57:08,980 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-09-03 19:57:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:09,169 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-09-03 19:57:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-03 19:57:09,170 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-09-03 19:57:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:09,170 INFO L225 Difference]: With dead ends: 161 [2019-09-03 19:57:09,171 INFO L226 Difference]: Without dead ends: 156 [2019-09-03 19:57:09,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2717, Invalid=3445, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:57:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-03 19:57:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-03 19:57:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 19:57:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2019-09-03 19:57:09,175 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2019-09-03 19:57:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:09,175 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2019-09-03 19:57:09,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-03 19:57:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2019-09-03 19:57:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 19:57:09,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:09,177 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:09,177 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1996978841, now seen corresponding path program 72 times [2019-09-03 19:57:09,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:09,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:09,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:11,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:11,084 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-03 19:57:11,094 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:11,274 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-09-03 19:57:11,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:11,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-03 19:57:11,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:11,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:11,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:11,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 79 [2019-09-03 19:57:11,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:57:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:57:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2785, Invalid=3377, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:57:11,379 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2019-09-03 19:57:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:11,572 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-09-03 19:57:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-03 19:57:11,572 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2019-09-03 19:57:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:11,573 INFO L225 Difference]: With dead ends: 163 [2019-09-03 19:57:11,573 INFO L226 Difference]: Without dead ends: 158 [2019-09-03 19:57:11,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2791, Invalid=3529, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:57:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-03 19:57:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-09-03 19:57:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 19:57:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-09-03 19:57:11,578 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2019-09-03 19:57:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:11,579 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-09-03 19:57:11,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:57:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-09-03 19:57:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 19:57:11,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:11,580 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:11,580 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 379798709, now seen corresponding path program 73 times [2019-09-03 19:57:11,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:11,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:11,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:13,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:13,579 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-03 19:57:13,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:13,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 80 conjunts are in the unsatisfiable core [2019-09-03 19:57:13,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:13,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 80 [2019-09-03 19:57:13,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-03 19:57:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-03 19:57:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2860, Invalid=3460, Unknown=0, NotChecked=0, Total=6320 [2019-09-03 19:57:13,784 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-09-03 19:57:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:13,985 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-09-03 19:57:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-03 19:57:13,985 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-09-03 19:57:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:13,987 INFO L225 Difference]: With dead ends: 165 [2019-09-03 19:57:13,987 INFO L226 Difference]: Without dead ends: 160 [2019-09-03 19:57:13,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2866, Invalid=3614, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:57:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-03 19:57:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2019-09-03 19:57:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 19:57:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2019-09-03 19:57:13,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2019-09-03 19:57:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:13,991 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2019-09-03 19:57:13,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-03 19:57:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2019-09-03 19:57:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 19:57:13,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:13,992 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:13,992 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1047853009, now seen corresponding path program 74 times [2019-09-03 19:57:13,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:13,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:13,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:13,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:13,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:16,028 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-03 19:57:16,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:16,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:16,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:16,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-03 19:57:16,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:16,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:16,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 81 [2019-09-03 19:57:16,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-03 19:57:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-03 19:57:16,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2936, Invalid=3544, Unknown=0, NotChecked=0, Total=6480 [2019-09-03 19:57:16,239 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2019-09-03 19:57:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:16,441 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-09-03 19:57:16,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:57:16,442 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2019-09-03 19:57:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:16,443 INFO L225 Difference]: With dead ends: 167 [2019-09-03 19:57:16,443 INFO L226 Difference]: Without dead ends: 162 [2019-09-03 19:57:16,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2942, Invalid=3700, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:57:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-03 19:57:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-03 19:57:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 19:57:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-09-03 19:57:16,447 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2019-09-03 19:57:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:16,447 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-09-03 19:57:16,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-03 19:57:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-09-03 19:57:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 19:57:16,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:16,449 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:16,449 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1197059091, now seen corresponding path program 75 times [2019-09-03 19:57:16,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:16,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:18,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:18,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 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-03 19:57:18,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:18,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-09-03 19:57:18,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:18,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-03 19:57:18,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:18,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 82 [2019-09-03 19:57:18,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-09-03 19:57:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-09-03 19:57:18,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3013, Invalid=3629, Unknown=0, NotChecked=0, Total=6642 [2019-09-03 19:57:18,874 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-09-03 19:57:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:19,023 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2019-09-03 19:57:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-03 19:57:19,023 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-09-03 19:57:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:19,025 INFO L225 Difference]: With dead ends: 169 [2019-09-03 19:57:19,025 INFO L226 Difference]: Without dead ends: 164 [2019-09-03 19:57:19,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3019, Invalid=3787, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:57:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-03 19:57:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-03 19:57:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-03 19:57:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-09-03 19:57:19,030 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2019-09-03 19:57:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:19,031 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-09-03 19:57:19,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-09-03 19:57:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-09-03 19:57:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-03 19:57:19,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:19,032 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:19,032 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1810962697, now seen corresponding path program 76 times [2019-09-03 19:57:19,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:19,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:19,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:21,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:21,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 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-03 19:57:21,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:21,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:21,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:21,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-03 19:57:21,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:21,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:21,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:21,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 83 [2019-09-03 19:57:21,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-03 19:57:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-03 19:57:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3091, Invalid=3715, Unknown=0, NotChecked=0, Total=6806 [2019-09-03 19:57:21,382 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 83 states. [2019-09-03 19:57:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:21,569 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-09-03 19:57:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-03 19:57:21,569 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2019-09-03 19:57:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:21,570 INFO L225 Difference]: With dead ends: 171 [2019-09-03 19:57:21,570 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 19:57:21,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3097, Invalid=3875, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:57:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 19:57:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 19:57:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 19:57:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-09-03 19:57:21,575 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2019-09-03 19:57:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:21,576 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-09-03 19:57:21,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-03 19:57:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-09-03 19:57:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 19:57:21,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:21,577 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:21,577 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2006910757, now seen corresponding path program 77 times [2019-09-03 19:57:21,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:21,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:21,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:21,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:23,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:23,773 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-03 19:57:23,783 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:23,987 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-03 19:57:23,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:23,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 84 conjunts are in the unsatisfiable core [2019-09-03 19:57:23,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:24,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:24,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:24,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 84 [2019-09-03 19:57:24,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-03 19:57:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-03 19:57:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3170, Invalid=3802, Unknown=0, NotChecked=0, Total=6972 [2019-09-03 19:57:24,089 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-09-03 19:57:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:24,310 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2019-09-03 19:57:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:57:24,311 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-09-03 19:57:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:24,312 INFO L225 Difference]: With dead ends: 173 [2019-09-03 19:57:24,312 INFO L226 Difference]: Without dead ends: 168 [2019-09-03 19:57:24,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3176, Invalid=3964, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:57:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-03 19:57:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-09-03 19:57:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:57:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-09-03 19:57:24,317 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2019-09-03 19:57:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:24,317 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-09-03 19:57:24,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-03 19:57:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-09-03 19:57:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 19:57:24,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:24,318 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:24,319 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:24,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1334435393, now seen corresponding path program 78 times [2019-09-03 19:57:24,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:24,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:24,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:24,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:26,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:26,622 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-03 19:57:26,632 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:26,840 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-09-03 19:57:26,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:26,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-03 19:57:26,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:26,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:26,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 85 [2019-09-03 19:57:26,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-03 19:57:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-03 19:57:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=3890, Unknown=0, NotChecked=0, Total=7140 [2019-09-03 19:57:26,934 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 85 states. [2019-09-03 19:57:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:27,105 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-09-03 19:57:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-03 19:57:27,105 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2019-09-03 19:57:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:27,106 INFO L225 Difference]: With dead ends: 175 [2019-09-03 19:57:27,107 INFO L226 Difference]: Without dead ends: 170 [2019-09-03 19:57:27,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3256, Invalid=4054, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:57:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-03 19:57:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-09-03 19:57:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 19:57:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-09-03 19:57:27,110 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2019-09-03 19:57:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:27,111 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-09-03 19:57:27,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-03 19:57:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-09-03 19:57:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 19:57:27,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:27,111 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:27,112 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -669295011, now seen corresponding path program 79 times [2019-09-03 19:57:27,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:27,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:27,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:27,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:27,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:29,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:29,361 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-03 19:57:29,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-03 19:57:29,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:29,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:29,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:29,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:29,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 86 [2019-09-03 19:57:29,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-03 19:57:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-03 19:57:29,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3331, Invalid=3979, Unknown=0, NotChecked=0, Total=7310 [2019-09-03 19:57:29,627 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-09-03 19:57:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:29,855 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-09-03 19:57:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-03 19:57:29,856 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-09-03 19:57:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:29,857 INFO L225 Difference]: With dead ends: 177 [2019-09-03 19:57:29,857 INFO L226 Difference]: Without dead ends: 172 [2019-09-03 19:57:29,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3337, Invalid=4145, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:57:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-03 19:57:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-03 19:57:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 19:57:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-09-03 19:57:29,861 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2019-09-03 19:57:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:29,861 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-09-03 19:57:29,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-03 19:57:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-09-03 19:57:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 19:57:29,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:29,862 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:29,862 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2108864647, now seen corresponding path program 80 times [2019-09-03 19:57:29,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:32,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:32,183 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-03 19:57:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:32,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:32,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:32,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-03 19:57:32,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:32,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:32,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:32,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 87 [2019-09-03 19:57:32,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-03 19:57:32,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-03 19:57:32,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3413, Invalid=4069, Unknown=0, NotChecked=0, Total=7482 [2019-09-03 19:57:32,395 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 87 states. [2019-09-03 19:57:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:32,638 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-09-03 19:57:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-03 19:57:32,639 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2019-09-03 19:57:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:32,640 INFO L225 Difference]: With dead ends: 179 [2019-09-03 19:57:32,640 INFO L226 Difference]: Without dead ends: 174 [2019-09-03 19:57:32,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3419, Invalid=4237, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:57:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-03 19:57:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-03 19:57:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-03 19:57:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-09-03 19:57:32,644 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2019-09-03 19:57:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:32,645 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-09-03 19:57:32,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-03 19:57:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-09-03 19:57:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 19:57:32,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:32,646 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:32,646 INFO L418 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1739151765, now seen corresponding path program 81 times [2019-09-03 19:57:32,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:32,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:32,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:32,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:35,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:35,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 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-03 19:57:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:35,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-09-03 19:57:35,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:35,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-03 19:57:35,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:35,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:35,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:35,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 88 [2019-09-03 19:57:35,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-03 19:57:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-03 19:57:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3496, Invalid=4160, Unknown=0, NotChecked=0, Total=7656 [2019-09-03 19:57:35,394 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-09-03 19:57:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:35,590 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-09-03 19:57:35,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-03 19:57:35,590 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-09-03 19:57:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:35,591 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:57:35,591 INFO L226 Difference]: Without dead ends: 176 [2019-09-03 19:57:35,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3502, Invalid=4330, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:57:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-03 19:57:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-03 19:57:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 19:57:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-09-03 19:57:35,597 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2019-09-03 19:57:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:35,597 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-09-03 19:57:35,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-03 19:57:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-09-03 19:57:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 19:57:35,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:35,598 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:35,599 INFO L418 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:35,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1716081841, now seen corresponding path program 82 times [2019-09-03 19:57:35,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:35,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:35,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:38,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:38,047 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-03 19:57:38,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:38,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:38,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:38,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 89 conjunts are in the unsatisfiable core [2019-09-03 19:57:38,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:38,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:38,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:38,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 89 [2019-09-03 19:57:38,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-03 19:57:38,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-03 19:57:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3580, Invalid=4252, Unknown=0, NotChecked=0, Total=7832 [2019-09-03 19:57:38,281 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 89 states. [2019-09-03 19:57:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:38,466 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-09-03 19:57:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-03 19:57:38,466 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2019-09-03 19:57:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:38,467 INFO L225 Difference]: With dead ends: 183 [2019-09-03 19:57:38,467 INFO L226 Difference]: Without dead ends: 178 [2019-09-03 19:57:38,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3586, Invalid=4424, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:57:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-03 19:57:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-03 19:57:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 19:57:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-09-03 19:57:38,471 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2019-09-03 19:57:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:38,471 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-09-03 19:57:38,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-03 19:57:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-09-03 19:57:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 19:57:38,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:38,472 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:38,473 INFO L418 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:38,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1020721357, now seen corresponding path program 83 times [2019-09-03 19:57:38,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:38,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:38,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:41,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:41,040 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-03 19:57:41,049 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:57:41,267 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-09-03 19:57:41,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:41,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 90 conjunts are in the unsatisfiable core [2019-09-03 19:57:41,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:41,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:41,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:41,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 90 [2019-09-03 19:57:41,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-03 19:57:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-03 19:57:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3665, Invalid=4345, Unknown=0, NotChecked=0, Total=8010 [2019-09-03 19:57:41,367 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-09-03 19:57:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:41,555 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-09-03 19:57:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-03 19:57:41,555 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-09-03 19:57:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:41,556 INFO L225 Difference]: With dead ends: 185 [2019-09-03 19:57:41,556 INFO L226 Difference]: Without dead ends: 180 [2019-09-03 19:57:41,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3671, Invalid=4519, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:57:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-03 19:57:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-03 19:57:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 19:57:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2019-09-03 19:57:41,561 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2019-09-03 19:57:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:41,561 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2019-09-03 19:57:41,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-03 19:57:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2019-09-03 19:57:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 19:57:41,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:41,562 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:41,562 INFO L418 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1500772887, now seen corresponding path program 84 times [2019-09-03 19:57:41,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:41,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:41,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:41,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:41,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:44,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:44,105 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-03 19:57:44,114 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:57:44,332 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-09-03 19:57:44,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:44,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 91 conjunts are in the unsatisfiable core [2019-09-03 19:57:44,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:44,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 91 [2019-09-03 19:57:44,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-03 19:57:44,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-03 19:57:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4439, Unknown=0, NotChecked=0, Total=8190 [2019-09-03 19:57:44,450 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 91 states. [2019-09-03 19:57:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:44,663 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-09-03 19:57:44,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-03 19:57:44,663 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2019-09-03 19:57:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:44,664 INFO L225 Difference]: With dead ends: 187 [2019-09-03 19:57:44,664 INFO L226 Difference]: Without dead ends: 182 [2019-09-03 19:57:44,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3757, Invalid=4615, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:57:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-03 19:57:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-03 19:57:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 19:57:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-09-03 19:57:44,669 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2019-09-03 19:57:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:44,669 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-09-03 19:57:44,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-03 19:57:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-09-03 19:57:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 19:57:44,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:44,671 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:44,671 INFO L418 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1999780869, now seen corresponding path program 85 times [2019-09-03 19:57:44,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:44,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:44,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:47,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:47,293 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-03 19:57:47,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:47,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 92 conjunts are in the unsatisfiable core [2019-09-03 19:57:47,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:47,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:47,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:47,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 92 [2019-09-03 19:57:47,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 19:57:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 19:57:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3838, Invalid=4534, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:57:47,526 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-09-03 19:57:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:47,794 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-09-03 19:57:47,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:57:47,794 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-09-03 19:57:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:47,795 INFO L225 Difference]: With dead ends: 189 [2019-09-03 19:57:47,795 INFO L226 Difference]: Without dead ends: 184 [2019-09-03 19:57:47,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3844, Invalid=4712, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:57:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-03 19:57:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-09-03 19:57:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 19:57:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2019-09-03 19:57:47,816 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2019-09-03 19:57:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:47,816 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2019-09-03 19:57:47,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 19:57:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2019-09-03 19:57:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 19:57:47,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:47,817 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:47,818 INFO L418 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1222419679, now seen corresponding path program 86 times [2019-09-03 19:57:47,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:47,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:47,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:47,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:57:47,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:50,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:50,489 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-03 19:57:50,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:57:50,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:57:50,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:50,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 93 conjunts are in the unsatisfiable core [2019-09-03 19:57:50,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:50,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 93 [2019-09-03 19:57:50,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-03 19:57:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-03 19:57:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=4630, Unknown=0, NotChecked=0, Total=8556 [2019-09-03 19:57:50,738 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 93 states. [2019-09-03 19:57:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:50,944 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-09-03 19:57:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-03 19:57:50,944 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 182 [2019-09-03 19:57:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:50,946 INFO L225 Difference]: With dead ends: 191 [2019-09-03 19:57:50,946 INFO L226 Difference]: Without dead ends: 186 [2019-09-03 19:57:50,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3932, Invalid=4810, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:57:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-03 19:57:50,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-09-03 19:57:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 19:57:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-09-03 19:57:50,951 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2019-09-03 19:57:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:50,951 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-09-03 19:57:50,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-09-03 19:57:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-09-03 19:57:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 19:57:50,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:50,952 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:50,953 INFO L418 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1085725891, now seen corresponding path program 87 times [2019-09-03 19:57:50,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:50,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:53,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:53,696 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-03 19:57:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:57:53,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-09-03 19:57:53,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:53,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:57:53,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:54,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:54,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 94 [2019-09-03 19:57:54,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-03 19:57:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-03 19:57:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4015, Invalid=4727, Unknown=0, NotChecked=0, Total=8742 [2019-09-03 19:57:54,046 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-09-03 19:57:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:54,250 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2019-09-03 19:57:54,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 19:57:54,251 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-09-03 19:57:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:54,252 INFO L225 Difference]: With dead ends: 193 [2019-09-03 19:57:54,252 INFO L226 Difference]: Without dead ends: 188 [2019-09-03 19:57:54,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4021, Invalid=4909, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:57:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-03 19:57:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-03 19:57:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 19:57:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-09-03 19:57:54,257 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2019-09-03 19:57:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:54,258 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-09-03 19:57:54,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-03 19:57:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-09-03 19:57:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 19:57:54,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:54,259 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:54,259 INFO L418 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:54,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1427985497, now seen corresponding path program 88 times [2019-09-03 19:57:54,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:54,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:54,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:54,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:54,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:57:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:57,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:57:57,315 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-03 19:57:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:57:57,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:57:57,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:57:57,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 95 conjunts are in the unsatisfiable core [2019-09-03 19:57:57,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:57:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:57:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:57:57,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:57:57,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 95 [2019-09-03 19:57:57,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:57:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:57:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4105, Invalid=4825, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:57:57,556 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 95 states. [2019-09-03 19:57:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:57:57,837 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-09-03 19:57:57,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-03 19:57:57,837 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 186 [2019-09-03 19:57:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:57:57,839 INFO L225 Difference]: With dead ends: 195 [2019-09-03 19:57:57,839 INFO L226 Difference]: Without dead ends: 190 [2019-09-03 19:57:57,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4111, Invalid=5009, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:57:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-03 19:57:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-09-03 19:57:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-03 19:57:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-09-03 19:57:57,843 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2019-09-03 19:57:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:57:57,844 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-09-03 19:57:57,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:57:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-09-03 19:57:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 19:57:57,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:57:57,845 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:57:57,845 INFO L418 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:57:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:57:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash -961958283, now seen corresponding path program 89 times [2019-09-03 19:57:57,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:57:57,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:57:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:57,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:57:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:57:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:00,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:00,796 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-03 19:58:00,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:01,062 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-09-03 19:58:01,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:01,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 96 conjunts are in the unsatisfiable core [2019-09-03 19:58:01,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:01,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:01,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:01,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 96 [2019-09-03 19:58:01,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-03 19:58:01,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-03 19:58:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4196, Invalid=4924, Unknown=0, NotChecked=0, Total=9120 [2019-09-03 19:58:01,175 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-09-03 19:58:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:01,432 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2019-09-03 19:58:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-03 19:58:01,432 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-09-03 19:58:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:01,433 INFO L225 Difference]: With dead ends: 197 [2019-09-03 19:58:01,433 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 19:58:01,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4202, Invalid=5110, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:58:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 19:58:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-03 19:58:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 19:58:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-09-03 19:58:01,437 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2019-09-03 19:58:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:01,437 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-09-03 19:58:01,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-03 19:58:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-09-03 19:58:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 19:58:01,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:01,438 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:01,438 INFO L418 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 109572497, now seen corresponding path program 90 times [2019-09-03 19:58:01,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:01,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:01,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:01,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:04,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:04,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 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-03 19:58:04,410 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:04,663 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-09-03 19:58:04,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:04,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 97 conjunts are in the unsatisfiable core [2019-09-03 19:58:04,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:04,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 97 [2019-09-03 19:58:04,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-03 19:58:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-03 19:58:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4288, Invalid=5024, Unknown=0, NotChecked=0, Total=9312 [2019-09-03 19:58:04,817 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 97 states. [2019-09-03 19:58:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:05,003 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-09-03 19:58:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:58:05,003 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 190 [2019-09-03 19:58:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:05,004 INFO L225 Difference]: With dead ends: 199 [2019-09-03 19:58:05,005 INFO L226 Difference]: Without dead ends: 194 [2019-09-03 19:58:05,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4294, Invalid=5212, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:58:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-03 19:58:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-09-03 19:58:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 19:58:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-09-03 19:58:05,009 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2019-09-03 19:58:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:05,009 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-09-03 19:58:05,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-03 19:58:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-09-03 19:58:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 19:58:05,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:05,010 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:05,010 INFO L418 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash -941498963, now seen corresponding path program 91 times [2019-09-03 19:58:05,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:05,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:05,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:05,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:07,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:07,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:08,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:58:08,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:08,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 98 [2019-09-03 19:58:08,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-09-03 19:58:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-09-03 19:58:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4381, Invalid=5125, Unknown=0, NotChecked=0, Total=9506 [2019-09-03 19:58:08,225 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-09-03 19:58:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:08,438 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-09-03 19:58:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-03 19:58:08,439 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-09-03 19:58:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:08,440 INFO L225 Difference]: With dead ends: 201 [2019-09-03 19:58:08,440 INFO L226 Difference]: Without dead ends: 196 [2019-09-03 19:58:08,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4387, Invalid=5315, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:58:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-03 19:58:08,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2019-09-03 19:58:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 19:58:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2019-09-03 19:58:08,444 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2019-09-03 19:58:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:08,445 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2019-09-03 19:58:08,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-09-03 19:58:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2019-09-03 19:58:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 19:58:08,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:08,446 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:08,446 INFO L418 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:08,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:08,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1703857463, now seen corresponding path program 92 times [2019-09-03 19:58:08,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:08,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:11,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:11,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:11,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:11,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:11,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:11,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 99 conjunts are in the unsatisfiable core [2019-09-03 19:58:11,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:11,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:11,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 99 [2019-09-03 19:58:11,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:58:11,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:58:11,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4475, Invalid=5227, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:58:11,768 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 99 states. [2019-09-03 19:58:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:12,012 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-09-03 19:58:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-09-03 19:58:12,012 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 194 [2019-09-03 19:58:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:12,014 INFO L225 Difference]: With dead ends: 203 [2019-09-03 19:58:12,014 INFO L226 Difference]: Without dead ends: 198 [2019-09-03 19:58:12,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4481, Invalid=5419, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:58:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-03 19:58:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-03 19:58:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-03 19:58:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-09-03 19:58:12,018 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2019-09-03 19:58:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:12,019 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-09-03 19:58:12,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:58:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-09-03 19:58:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-03 19:58:12,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:12,020 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:12,020 INFO L418 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash 109031653, now seen corresponding path program 93 times [2019-09-03 19:58:12,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:12,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:12,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:15,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:15,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:15,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:15,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-09-03 19:58:15,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:15,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 100 conjunts are in the unsatisfiable core [2019-09-03 19:58:15,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:15,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:15,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:15,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 100 [2019-09-03 19:58:15,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-03 19:58:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-03 19:58:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4570, Invalid=5330, Unknown=0, NotChecked=0, Total=9900 [2019-09-03 19:58:15,534 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-09-03 19:58:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:15,789 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-09-03 19:58:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-03 19:58:15,790 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-09-03 19:58:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:15,791 INFO L225 Difference]: With dead ends: 205 [2019-09-03 19:58:15,791 INFO L226 Difference]: Without dead ends: 200 [2019-09-03 19:58:15,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4576, Invalid=5524, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:58:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-03 19:58:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-03 19:58:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-03 19:58:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-09-03 19:58:15,796 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2019-09-03 19:58:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:15,797 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-09-03 19:58:15,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-09-03 19:58:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-09-03 19:58:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-03 19:58:15,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:15,798 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:15,798 INFO L418 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:15,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:15,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1461250047, now seen corresponding path program 94 times [2019-09-03 19:58:15,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:15,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:15,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:15,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:19,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:19,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:19,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:19,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:19,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:19,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-03 19:58:19,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:19,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 101 [2019-09-03 19:58:19,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:58:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:58:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4666, Invalid=5434, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:58:19,268 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 101 states. [2019-09-03 19:58:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:19,479 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-09-03 19:58:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:58:19,479 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 198 [2019-09-03 19:58:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:19,481 INFO L225 Difference]: With dead ends: 207 [2019-09-03 19:58:19,481 INFO L226 Difference]: Without dead ends: 202 [2019-09-03 19:58:19,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4672, Invalid=5630, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:58:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-03 19:58:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-09-03 19:58:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-09-03 19:58:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-09-03 19:58:19,484 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2019-09-03 19:58:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:19,484 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-09-03 19:58:19,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:58:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-09-03 19:58:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-03 19:58:19,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:19,486 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:19,486 INFO L418 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1326524445, now seen corresponding path program 95 times [2019-09-03 19:58:19,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:19,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:22,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:22,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:22,981 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-09-03 19:58:22,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:22,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-03 19:58:22,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:22,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:23,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:23,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 102 [2019-09-03 19:58:23,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 19:58:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 19:58:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4763, Invalid=5539, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:58:23,103 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-09-03 19:58:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:23,300 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2019-09-03 19:58:23,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-09-03 19:58:23,300 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-09-03 19:58:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:23,301 INFO L225 Difference]: With dead ends: 209 [2019-09-03 19:58:23,301 INFO L226 Difference]: Without dead ends: 204 [2019-09-03 19:58:23,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4769, Invalid=5737, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:58:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-03 19:58:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-09-03 19:58:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 19:58:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2019-09-03 19:58:23,305 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2019-09-03 19:58:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:23,305 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2019-09-03 19:58:23,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 19:58:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2019-09-03 19:58:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 19:58:23,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:23,306 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:23,306 INFO L418 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash 318218553, now seen corresponding path program 96 times [2019-09-03 19:58:23,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:23,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:23,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:23,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:26,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:26,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:26,678 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:26,946 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-09-03 19:58:26,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:26,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 103 conjunts are in the unsatisfiable core [2019-09-03 19:58:26,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:27,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:27,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 103 [2019-09-03 19:58:27,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-09-03 19:58:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-09-03 19:58:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4861, Invalid=5645, Unknown=0, NotChecked=0, Total=10506 [2019-09-03 19:58:27,070 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 103 states. [2019-09-03 19:58:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:27,371 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-09-03 19:58:27,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:58:27,371 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 202 [2019-09-03 19:58:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:27,372 INFO L225 Difference]: With dead ends: 211 [2019-09-03 19:58:27,372 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 19:58:27,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4867, Invalid=5845, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:58:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 19:58:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-03 19:58:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 19:58:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-09-03 19:58:27,376 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2019-09-03 19:58:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:27,376 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-09-03 19:58:27,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-09-03 19:58:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-09-03 19:58:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 19:58:27,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:27,377 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:27,377 INFO L418 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:27,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1998865237, now seen corresponding path program 97 times [2019-09-03 19:58:27,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:27,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:27,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:27,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:27,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:30,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:30,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:30,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:30,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 104 conjunts are in the unsatisfiable core [2019-09-03 19:58:30,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:30,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:31,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:31,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 104 [2019-09-03 19:58:31,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-09-03 19:58:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-09-03 19:58:31,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4960, Invalid=5752, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:58:31,070 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-09-03 19:58:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:31,322 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-09-03 19:58:31,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 19:58:31,322 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-09-03 19:58:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:31,323 INFO L225 Difference]: With dead ends: 213 [2019-09-03 19:58:31,323 INFO L226 Difference]: Without dead ends: 208 [2019-09-03 19:58:31,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4966, Invalid=5954, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:58:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-03 19:58:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2019-09-03 19:58:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-03 19:58:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-09-03 19:58:31,327 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2019-09-03 19:58:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:31,327 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-09-03 19:58:31,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-09-03 19:58:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-09-03 19:58:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-03 19:58:31,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:31,329 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:31,329 INFO L418 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:31,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2102342031, now seen corresponding path program 98 times [2019-09-03 19:58:31,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:31,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:31,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:31,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:31,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:34,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:34,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:34,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:58:34,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:58:34,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:34,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-03 19:58:34,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:34,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:35,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:35,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 105 [2019-09-03 19:58:35,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-03 19:58:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-03 19:58:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5060, Invalid=5860, Unknown=0, NotChecked=0, Total=10920 [2019-09-03 19:58:35,065 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 105 states. [2019-09-03 19:58:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:35,365 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-09-03 19:58:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-03 19:58:35,366 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 206 [2019-09-03 19:58:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:35,367 INFO L225 Difference]: With dead ends: 215 [2019-09-03 19:58:35,367 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 19:58:35,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5066, Invalid=6064, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:58:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 19:58:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-03 19:58:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 19:58:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-09-03 19:58:35,372 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2019-09-03 19:58:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:35,372 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-09-03 19:58:35,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-03 19:58:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-09-03 19:58:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 19:58:35,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:35,373 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:35,373 INFO L418 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash -582548851, now seen corresponding path program 99 times [2019-09-03 19:58:35,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:35,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:35,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:38,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:38,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:58:39,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-09-03 19:58:39,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:39,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 106 conjunts are in the unsatisfiable core [2019-09-03 19:58:39,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:39,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 106 [2019-09-03 19:58:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-03 19:58:39,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-03 19:58:39,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5161, Invalid=5969, Unknown=0, NotChecked=0, Total=11130 [2019-09-03 19:58:39,355 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-09-03 19:58:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:39,556 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2019-09-03 19:58:39,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-09-03 19:58:39,557 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-09-03 19:58:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:39,558 INFO L225 Difference]: With dead ends: 217 [2019-09-03 19:58:39,559 INFO L226 Difference]: Without dead ends: 212 [2019-09-03 19:58:39,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5167, Invalid=6175, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 19:58:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-03 19:58:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-09-03 19:58:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 19:58:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-09-03 19:58:39,564 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2019-09-03 19:58:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:39,564 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-09-03 19:58:39,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-09-03 19:58:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-09-03 19:58:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 19:58:39,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:39,566 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:39,566 INFO L418 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:39,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash -350183511, now seen corresponding path program 100 times [2019-09-03 19:58:39,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:39,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:43,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:43,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:43,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:58:43,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:58:43,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:43,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-03 19:58:43,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:43,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:43,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:43,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 107 [2019-09-03 19:58:43,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-03 19:58:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-03 19:58:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5263, Invalid=6079, Unknown=0, NotChecked=0, Total=11342 [2019-09-03 19:58:43,465 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 107 states. [2019-09-03 19:58:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:43,800 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-09-03 19:58:43,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-03 19:58:43,800 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 210 [2019-09-03 19:58:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:43,802 INFO L225 Difference]: With dead ends: 219 [2019-09-03 19:58:43,802 INFO L226 Difference]: Without dead ends: 214 [2019-09-03 19:58:43,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5269, Invalid=6287, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:58:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-03 19:58:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-09-03 19:58:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 19:58:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-09-03 19:58:43,806 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2019-09-03 19:58:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:43,806 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-09-03 19:58:43,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-03 19:58:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-09-03 19:58:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 19:58:43,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:43,808 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:43,808 INFO L418 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash -385391163, now seen corresponding path program 101 times [2019-09-03 19:58:43,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:43,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:47,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:47,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:47,469 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:58:47,795 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2019-09-03 19:58:47,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:47,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:58:47,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:47,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:47,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:47,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 108 [2019-09-03 19:58:47,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-09-03 19:58:47,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-09-03 19:58:47,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5366, Invalid=6190, Unknown=0, NotChecked=0, Total=11556 [2019-09-03 19:58:47,959 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-09-03 19:58:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:48,340 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-09-03 19:58:48,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-03 19:58:48,340 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-09-03 19:58:48,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:48,341 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:58:48,341 INFO L226 Difference]: Without dead ends: 216 [2019-09-03 19:58:48,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5372, Invalid=6400, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:58:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-03 19:58:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-03 19:58:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-03 19:58:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2019-09-03 19:58:48,345 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2019-09-03 19:58:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:48,346 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2019-09-03 19:58:48,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-09-03 19:58:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2019-09-03 19:58:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-03 19:58:48,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:48,347 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:48,348 INFO L418 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 139793633, now seen corresponding path program 102 times [2019-09-03 19:58:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:48,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:48,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:52,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:52,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:52,101 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:58:52,392 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2019-09-03 19:58:52,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:58:52,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-03 19:58:52,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:52,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:52,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:52,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 109 [2019-09-03 19:58:52,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-03 19:58:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-03 19:58:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5470, Invalid=6302, Unknown=0, NotChecked=0, Total=11772 [2019-09-03 19:58:52,523 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 109 states. [2019-09-03 19:58:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:52,881 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-09-03 19:58:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-03 19:58:52,881 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 214 [2019-09-03 19:58:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:52,882 INFO L225 Difference]: With dead ends: 223 [2019-09-03 19:58:52,882 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:58:52,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5476, Invalid=6514, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:58:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:58:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-09-03 19:58:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-03 19:58:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-09-03 19:58:52,887 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2019-09-03 19:58:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:52,887 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-09-03 19:58:52,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-03 19:58:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-09-03 19:58:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-03 19:58:52,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:52,888 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:52,889 INFO L418 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:52,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1963758339, now seen corresponding path program 103 times [2019-09-03 19:58:52,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:52,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:58:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:56,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:58:56,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:58:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:58:56,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 110 conjunts are in the unsatisfiable core [2019-09-03 19:58:56,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:58:56,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:58:56,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:58:56,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:58:56,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 110 [2019-09-03 19:58:56,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-09-03 19:58:56,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-09-03 19:58:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5575, Invalid=6415, Unknown=0, NotChecked=0, Total=11990 [2019-09-03 19:58:56,976 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-09-03 19:58:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:58:57,340 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-09-03 19:58:57,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-09-03 19:58:57,340 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-09-03 19:58:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:58:57,341 INFO L225 Difference]: With dead ends: 225 [2019-09-03 19:58:57,341 INFO L226 Difference]: Without dead ends: 220 [2019-09-03 19:58:57,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5581, Invalid=6629, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:58:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-03 19:58:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-09-03 19:58:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-03 19:58:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2019-09-03 19:58:57,346 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2019-09-03 19:58:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:58:57,346 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2019-09-03 19:58:57,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-09-03 19:58:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2019-09-03 19:58:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-03 19:58:57,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:58:57,348 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:58:57,348 INFO L418 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:58:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:58:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash -547607015, now seen corresponding path program 104 times [2019-09-03 19:58:57,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:58:57,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:58:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:57,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:58:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:58:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:01,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:01,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:01,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:01,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:01,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:01,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 111 conjunts are in the unsatisfiable core [2019-09-03 19:59:01,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:01,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:01,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:01,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 111 [2019-09-03 19:59:01,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-03 19:59:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-03 19:59:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5681, Invalid=6529, Unknown=0, NotChecked=0, Total=12210 [2019-09-03 19:59:01,524 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 111 states. [2019-09-03 19:59:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:01,895 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-09-03 19:59:01,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-09-03 19:59:01,895 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 218 [2019-09-03 19:59:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:01,896 INFO L225 Difference]: With dead ends: 227 [2019-09-03 19:59:01,896 INFO L226 Difference]: Without dead ends: 222 [2019-09-03 19:59:01,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5687, Invalid=6745, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:59:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-03 19:59:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-09-03 19:59:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-03 19:59:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-09-03 19:59:01,900 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2019-09-03 19:59:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:01,901 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-09-03 19:59:01,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-03 19:59:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-09-03 19:59:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-03 19:59:01,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:01,902 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:01,902 INFO L418 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1130817483, now seen corresponding path program 105 times [2019-09-03 19:59:01,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:01,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:01,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:05,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:05,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:05,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:06,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2019-09-03 19:59:06,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:06,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 112 conjunts are in the unsatisfiable core [2019-09-03 19:59:06,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:06,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:06,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:06,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 112 [2019-09-03 19:59:06,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-09-03 19:59:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-09-03 19:59:06,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5788, Invalid=6644, Unknown=0, NotChecked=0, Total=12432 [2019-09-03 19:59:06,272 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-09-03 19:59:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:06,506 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2019-09-03 19:59:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 19:59:06,506 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-09-03 19:59:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:06,507 INFO L225 Difference]: With dead ends: 229 [2019-09-03 19:59:06,507 INFO L226 Difference]: Without dead ends: 224 [2019-09-03 19:59:06,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5794, Invalid=6862, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:59:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-03 19:59:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-09-03 19:59:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-03 19:59:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-09-03 19:59:06,512 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2019-09-03 19:59:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:06,513 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-09-03 19:59:06,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-09-03 19:59:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-09-03 19:59:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-03 19:59:06,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:06,514 INFO L399 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:06,514 INFO L418 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1044638545, now seen corresponding path program 106 times [2019-09-03 19:59:06,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:06,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:10,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:10,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:10,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:10,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:10,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:10,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 113 conjunts are in the unsatisfiable core [2019-09-03 19:59:10,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:10,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:10,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:10,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 113 [2019-09-03 19:59:10,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-09-03 19:59:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-09-03 19:59:10,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5896, Invalid=6760, Unknown=0, NotChecked=0, Total=12656 [2019-09-03 19:59:10,840 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 113 states. [2019-09-03 19:59:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:11,158 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-09-03 19:59:11,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-03 19:59:11,159 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 222 [2019-09-03 19:59:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:11,160 INFO L225 Difference]: With dead ends: 231 [2019-09-03 19:59:11,160 INFO L226 Difference]: Without dead ends: 226 [2019-09-03 19:59:11,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5902, Invalid=6980, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:59:11,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-03 19:59:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-09-03 19:59:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-03 19:59:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-09-03 19:59:11,164 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2019-09-03 19:59:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:11,164 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-09-03 19:59:11,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-09-03 19:59:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-09-03 19:59:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-03 19:59:11,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:11,165 INFO L399 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:11,165 INFO L418 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:11,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:11,165 INFO L82 PathProgramCache]: Analyzing trace with hash 8808301, now seen corresponding path program 107 times [2019-09-03 19:59:11,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:11,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:11,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:15,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:15,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:15,251 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:15,577 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2019-09-03 19:59:15,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:15,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 114 conjunts are in the unsatisfiable core [2019-09-03 19:59:15,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:15,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:15,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:15,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 114 [2019-09-03 19:59:15,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-09-03 19:59:15,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-09-03 19:59:15,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6005, Invalid=6877, Unknown=0, NotChecked=0, Total=12882 [2019-09-03 19:59:15,731 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-09-03 19:59:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:16,117 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2019-09-03 19:59:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-09-03 19:59:16,117 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-09-03 19:59:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:16,118 INFO L225 Difference]: With dead ends: 233 [2019-09-03 19:59:16,118 INFO L226 Difference]: Without dead ends: 228 [2019-09-03 19:59:16,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6011, Invalid=7099, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:59:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-03 19:59:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2019-09-03 19:59:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-03 19:59:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-09-03 19:59:16,121 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2019-09-03 19:59:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:16,121 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-09-03 19:59:16,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-09-03 19:59:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-09-03 19:59:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-03 19:59:16,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:16,122 INFO L399 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:16,122 INFO L418 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1008356489, now seen corresponding path program 108 times [2019-09-03 19:59:16,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:16,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:16,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:20,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:20,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:20,230 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:20,549 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2019-09-03 19:59:20,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:20,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-03 19:59:20,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:20,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:20,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:20,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 115 [2019-09-03 19:59:20,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-09-03 19:59:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-09-03 19:59:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6115, Invalid=6995, Unknown=0, NotChecked=0, Total=13110 [2019-09-03 19:59:20,728 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 115 states. [2019-09-03 19:59:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:21,041 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-09-03 19:59:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-09-03 19:59:21,041 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 226 [2019-09-03 19:59:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:21,042 INFO L225 Difference]: With dead ends: 235 [2019-09-03 19:59:21,042 INFO L226 Difference]: Without dead ends: 230 [2019-09-03 19:59:21,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6121, Invalid=7219, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:59:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-03 19:59:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-09-03 19:59:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-03 19:59:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-09-03 19:59:21,046 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2019-09-03 19:59:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:21,046 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-09-03 19:59:21,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-09-03 19:59:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-09-03 19:59:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-03 19:59:21,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:21,047 INFO L399 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:21,047 INFO L418 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash -498509147, now seen corresponding path program 109 times [2019-09-03 19:59:21,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:25,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:25,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:25,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 116 conjunts are in the unsatisfiable core [2019-09-03 19:59:25,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:25,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 116 [2019-09-03 19:59:25,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-09-03 19:59:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-09-03 19:59:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6226, Invalid=7114, Unknown=0, NotChecked=0, Total=13340 [2019-09-03 19:59:25,589 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-09-03 19:59:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:25,845 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-09-03 19:59:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-03 19:59:25,846 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-09-03 19:59:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:25,847 INFO L225 Difference]: With dead ends: 237 [2019-09-03 19:59:25,847 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 19:59:25,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6232, Invalid=7340, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:59:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 19:59:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2019-09-03 19:59:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-03 19:59:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-09-03 19:59:25,851 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2019-09-03 19:59:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:25,851 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-09-03 19:59:25,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-09-03 19:59:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-09-03 19:59:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-03 19:59:25,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:25,852 INFO L399 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:25,852 INFO L418 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1192406591, now seen corresponding path program 110 times [2019-09-03 19:59:25,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:25,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:30,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:30,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:59:30,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:59:30,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:30,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 117 conjunts are in the unsatisfiable core [2019-09-03 19:59:30,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:30,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:30,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:30,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 117 [2019-09-03 19:59:30,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-09-03 19:59:30,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-09-03 19:59:30,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6338, Invalid=7234, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:59:30,515 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 117 states. [2019-09-03 19:59:30,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:30,940 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-09-03 19:59:30,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-03 19:59:30,940 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 230 [2019-09-03 19:59:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:30,941 INFO L225 Difference]: With dead ends: 239 [2019-09-03 19:59:30,941 INFO L226 Difference]: Without dead ends: 234 [2019-09-03 19:59:30,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6344, Invalid=7462, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:59:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-03 19:59:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-09-03 19:59:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-03 19:59:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-09-03 19:59:30,945 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2019-09-03 19:59:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:30,945 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-09-03 19:59:30,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-09-03 19:59:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-09-03 19:59:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-03 19:59:30,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:30,946 INFO L399 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:30,946 INFO L418 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1987047901, now seen corresponding path program 111 times [2019-09-03 19:59:30,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:30,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:30,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:35,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:35,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:59:35,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2019-09-03 19:59:35,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:35,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 118 conjunts are in the unsatisfiable core [2019-09-03 19:59:35,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:35,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:35,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 118 [2019-09-03 19:59:35,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-09-03 19:59:35,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-09-03 19:59:35,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6451, Invalid=7355, Unknown=0, NotChecked=0, Total=13806 [2019-09-03 19:59:35,813 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-09-03 19:59:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:36,243 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-09-03 19:59:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-09-03 19:59:36,244 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-09-03 19:59:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:36,245 INFO L225 Difference]: With dead ends: 241 [2019-09-03 19:59:36,245 INFO L226 Difference]: Without dead ends: 236 [2019-09-03 19:59:36,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6457, Invalid=7585, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:59:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-03 19:59:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-09-03 19:59:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-03 19:59:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-09-03 19:59:36,249 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2019-09-03 19:59:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:36,249 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-09-03 19:59:36,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-09-03 19:59:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-09-03 19:59:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-03 19:59:36,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:36,250 INFO L399 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:36,250 INFO L418 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash -573900039, now seen corresponding path program 112 times [2019-09-03 19:59:36,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:36,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:36,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:36,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:40,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:40,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:40,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:59:41,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:59:41,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:41,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-03 19:59:41,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:41,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:41,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:41,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 119 [2019-09-03 19:59:41,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-09-03 19:59:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-09-03 19:59:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6565, Invalid=7477, Unknown=0, NotChecked=0, Total=14042 [2019-09-03 19:59:41,291 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 119 states. [2019-09-03 19:59:41,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:41,709 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-09-03 19:59:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-03 19:59:41,710 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 234 [2019-09-03 19:59:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:41,710 INFO L225 Difference]: With dead ends: 243 [2019-09-03 19:59:41,711 INFO L226 Difference]: Without dead ends: 238 [2019-09-03 19:59:41,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6571, Invalid=7709, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 19:59:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-03 19:59:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-09-03 19:59:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-03 19:59:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-09-03 19:59:41,715 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2019-09-03 19:59:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:41,715 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-09-03 19:59:41,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-09-03 19:59:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-09-03 19:59:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 19:59:41,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:41,716 INFO L399 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:41,716 INFO L418 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -628609771, now seen corresponding path program 113 times [2019-09-03 19:59:41,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:41,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:41,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:46,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:46,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:46,194 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:59:46,550 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2019-09-03 19:59:46,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:46,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 120 conjunts are in the unsatisfiable core [2019-09-03 19:59:46,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:46,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:46,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 120 [2019-09-03 19:59:46,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-09-03 19:59:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-09-03 19:59:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6680, Invalid=7600, Unknown=0, NotChecked=0, Total=14280 [2019-09-03 19:59:46,706 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-09-03 19:59:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:47,149 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-09-03 19:59:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-09-03 19:59:47,149 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-09-03 19:59:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:47,150 INFO L225 Difference]: With dead ends: 245 [2019-09-03 19:59:47,150 INFO L226 Difference]: Without dead ends: 240 [2019-09-03 19:59:47,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6686, Invalid=7834, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:59:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-03 19:59:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-09-03 19:59:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-03 19:59:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2019-09-03 19:59:47,154 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2019-09-03 19:59:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:47,155 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2019-09-03 19:59:47,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-09-03 19:59:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2019-09-03 19:59:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-03 19:59:47,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:47,155 INFO L399 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:47,156 INFO L418 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:47,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1665054671, now seen corresponding path program 114 times [2019-09-03 19:59:47,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:47,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:47,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:47,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:51,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:51,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:51,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:59:52,073 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2019-09-03 19:59:52,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:59:52,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 121 conjunts are in the unsatisfiable core [2019-09-03 19:59:52,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:52,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:52,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:52,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 121 [2019-09-03 19:59:52,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-03 19:59:52,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-03 19:59:52,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6796, Invalid=7724, Unknown=0, NotChecked=0, Total=14520 [2019-09-03 19:59:52,239 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 121 states. [2019-09-03 19:59:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:52,661 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-09-03 19:59:52,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-03 19:59:52,662 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 238 [2019-09-03 19:59:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:52,662 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:59:52,662 INFO L226 Difference]: Without dead ends: 242 [2019-09-03 19:59:52,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6802, Invalid=7960, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:59:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-03 19:59:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-09-03 19:59:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-03 19:59:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-09-03 19:59:52,667 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2019-09-03 19:59:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:52,667 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-09-03 19:59:52,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-09-03 19:59:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-09-03 19:59:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-03 19:59:52,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:52,668 INFO L399 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:52,668 INFO L418 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1256190899, now seen corresponding path program 115 times [2019-09-03 19:59:52,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:52,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:52,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:52,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:59:52,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:57,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:59:57,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:59:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:59:57,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 122 conjunts are in the unsatisfiable core [2019-09-03 19:59:57,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:59:57,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:59:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:59:57,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:59:57,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 122 [2019-09-03 19:59:57,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-09-03 19:59:57,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-09-03 19:59:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6913, Invalid=7849, Unknown=0, NotChecked=0, Total=14762 [2019-09-03 19:59:57,649 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-09-03 19:59:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:59:57,931 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-09-03 19:59:57,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-03 19:59:57,932 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-09-03 19:59:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:59:57,933 INFO L225 Difference]: With dead ends: 249 [2019-09-03 19:59:57,933 INFO L226 Difference]: Without dead ends: 244 [2019-09-03 19:59:57,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6919, Invalid=8087, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 19:59:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-03 19:59:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2019-09-03 19:59:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-03 19:59:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2019-09-03 19:59:57,937 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2019-09-03 19:59:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:59:57,937 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2019-09-03 19:59:57,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-09-03 19:59:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2019-09-03 19:59:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-03 19:59:57,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:59:57,938 INFO L399 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:59:57,939 INFO L418 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:59:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:59:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash 819870057, now seen corresponding path program 116 times [2019-09-03 19:59:57,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:59:57,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:59:57,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:57,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:59:57,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:59:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:02,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:02,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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:02,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:02,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:02,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:02,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 123 conjunts are in the unsatisfiable core [2019-09-03 20:00:02,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:02,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:03,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:03,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 123 [2019-09-03 20:00:03,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-09-03 20:00:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-09-03 20:00:03,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7031, Invalid=7975, Unknown=0, NotChecked=0, Total=15006 [2019-09-03 20:00:03,099 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 123 states. [2019-09-03 20:00:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:03,435 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-09-03 20:00:03,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-03 20:00:03,435 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 242 [2019-09-03 20:00:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:03,436 INFO L225 Difference]: With dead ends: 251 [2019-09-03 20:00:03,436 INFO L226 Difference]: Without dead ends: 246 [2019-09-03 20:00:03,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7037, Invalid=8215, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:00:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-03 20:00:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-09-03 20:00:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-03 20:00:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-09-03 20:00:03,440 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2019-09-03 20:00:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:03,440 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-09-03 20:00:03,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-09-03 20:00:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-09-03 20:00:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-03 20:00:03,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:03,441 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:03,441 INFO L418 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:03,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:03,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1245343867, now seen corresponding path program 117 times [2019-09-03 20:00:03,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:03,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:03,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:03,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:08,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:08,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:08,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:08,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2019-09-03 20:00:08,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 124 conjunts are in the unsatisfiable core [2019-09-03 20:00:08,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:08,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:08,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:08,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 124 [2019-09-03 20:00:08,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-09-03 20:00:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-09-03 20:00:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7150, Invalid=8102, Unknown=0, NotChecked=0, Total=15252 [2019-09-03 20:00:08,790 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-09-03 20:00:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:09,295 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-03 20:00:09,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-09-03 20:00:09,295 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-09-03 20:00:09,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:09,296 INFO L225 Difference]: With dead ends: 253 [2019-09-03 20:00:09,296 INFO L226 Difference]: Without dead ends: 248 [2019-09-03 20:00:09,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7156, Invalid=8344, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:00:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-03 20:00:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-09-03 20:00:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-03 20:00:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-09-03 20:00:09,300 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2019-09-03 20:00:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:09,301 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-09-03 20:00:09,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-09-03 20:00:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-09-03 20:00:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-03 20:00:09,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:09,302 INFO L399 BasicCegarLoop]: trace histogram [118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:09,302 INFO L418 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1641034079, now seen corresponding path program 118 times [2019-09-03 20:00:09,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:09,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:14,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:14,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:14,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:14,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:14,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 125 conjunts are in the unsatisfiable core [2019-09-03 20:00:14,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:14,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:14,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:14,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 125 [2019-09-03 20:00:14,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-09-03 20:00:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-09-03 20:00:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7270, Invalid=8230, Unknown=0, NotChecked=0, Total=15500 [2019-09-03 20:00:14,511 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 125 states. [2019-09-03 20:00:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:14,946 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-09-03 20:00:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-09-03 20:00:14,946 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 246 [2019-09-03 20:00:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:14,947 INFO L225 Difference]: With dead ends: 255 [2019-09-03 20:00:14,948 INFO L226 Difference]: Without dead ends: 250 [2019-09-03 20:00:14,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7276, Invalid=8474, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:00:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-03 20:00:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-03 20:00:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-03 20:00:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-09-03 20:00:14,952 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2019-09-03 20:00:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:14,952 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-09-03 20:00:14,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-09-03 20:00:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-09-03 20:00:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 20:00:14,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:14,953 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:14,954 INFO L418 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash 352761533, now seen corresponding path program 119 times [2019-09-03 20:00:14,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:14,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:14,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:14,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:14,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:19,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:19,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:20,378 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2019-09-03 20:00:20,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:20,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 126 conjunts are in the unsatisfiable core [2019-09-03 20:00:20,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:20,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:20,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 126 [2019-09-03 20:00:20,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-03 20:00:20,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-03 20:00:20,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7391, Invalid=8359, Unknown=0, NotChecked=0, Total=15750 [2019-09-03 20:00:20,551 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-09-03 20:00:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:20,839 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2019-09-03 20:00:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-09-03 20:00:20,840 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-09-03 20:00:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:20,841 INFO L225 Difference]: With dead ends: 257 [2019-09-03 20:00:20,841 INFO L226 Difference]: Without dead ends: 252 [2019-09-03 20:00:20,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7397, Invalid=8605, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 20:00:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-03 20:00:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-09-03 20:00:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-03 20:00:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-09-03 20:00:20,845 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2019-09-03 20:00:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:20,846 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-09-03 20:00:20,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-09-03 20:00:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-09-03 20:00:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-03 20:00:20,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:20,846 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:20,847 INFO L418 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:20,847 INFO L82 PathProgramCache]: Analyzing trace with hash 834930649, now seen corresponding path program 120 times [2019-09-03 20:00:20,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:20,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:20,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:20,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:20,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:25,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:25,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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:00:26,321 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2019-09-03 20:00:26,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:26,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 127 conjunts are in the unsatisfiable core [2019-09-03 20:00:26,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:26,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:26,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 127 [2019-09-03 20:00:26,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-09-03 20:00:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-09-03 20:00:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7513, Invalid=8489, Unknown=0, NotChecked=0, Total=16002 [2019-09-03 20:00:26,468 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 127 states. [2019-09-03 20:00:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:27,003 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-09-03 20:00:27,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-03 20:00:27,003 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 250 [2019-09-03 20:00:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:27,004 INFO L225 Difference]: With dead ends: 259 [2019-09-03 20:00:27,004 INFO L226 Difference]: Without dead ends: 254 [2019-09-03 20:00:27,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7519, Invalid=8737, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:00:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-03 20:00:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-09-03 20:00:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-03 20:00:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-09-03 20:00:27,008 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2019-09-03 20:00:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:27,009 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-09-03 20:00:27,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-09-03 20:00:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-09-03 20:00:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-03 20:00:27,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:27,010 INFO L399 BasicCegarLoop]: trace histogram [121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:27,010 INFO L418 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:27,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 342983157, now seen corresponding path program 121 times [2019-09-03 20:00:27,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:27,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:27,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:32,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:32,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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:32,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:32,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-03 20:00:32,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:32,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:32,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 128 [2019-09-03 20:00:32,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-09-03 20:00:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-09-03 20:00:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7636, Invalid=8620, Unknown=0, NotChecked=0, Total=16256 [2019-09-03 20:00:32,484 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-09-03 20:00:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:33,027 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-09-03 20:00:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-03 20:00:33,027 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-09-03 20:00:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:33,028 INFO L225 Difference]: With dead ends: 261 [2019-09-03 20:00:33,028 INFO L226 Difference]: Without dead ends: 256 [2019-09-03 20:00:33,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7642, Invalid=8870, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:00:33,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-09-03 20:00:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2019-09-03 20:00:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-03 20:00:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2019-09-03 20:00:33,033 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2019-09-03 20:00:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:33,033 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2019-09-03 20:00:33,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-09-03 20:00:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2019-09-03 20:00:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-03 20:00:33,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:33,034 INFO L399 BasicCegarLoop]: trace histogram [122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:33,034 INFO L418 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 27845905, now seen corresponding path program 122 times [2019-09-03 20:00:33,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:33,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:33,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:33,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:00:33,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:38,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:38,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:38,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:00:38,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:00:38,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:38,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1366 conjuncts, 129 conjunts are in the unsatisfiable core [2019-09-03 20:00:38,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:38,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:38,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:38,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 129 [2019-09-03 20:00:38,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-03 20:00:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-03 20:00:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7760, Invalid=8752, Unknown=0, NotChecked=0, Total=16512 [2019-09-03 20:00:38,605 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 129 states. [2019-09-03 20:00:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:39,150 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-09-03 20:00:39,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-09-03 20:00:39,150 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 254 [2019-09-03 20:00:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:39,151 INFO L225 Difference]: With dead ends: 263 [2019-09-03 20:00:39,151 INFO L226 Difference]: Without dead ends: 258 [2019-09-03 20:00:39,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7766, Invalid=9004, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:00:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-03 20:00:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-09-03 20:00:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-09-03 20:00:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-09-03 20:00:39,154 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2019-09-03 20:00:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:39,155 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-09-03 20:00:39,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-03 20:00:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-09-03 20:00:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-03 20:00:39,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:39,156 INFO L399 BasicCegarLoop]: trace histogram [123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:39,156 INFO L418 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2123624749, now seen corresponding path program 123 times [2019-09-03 20:00:39,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:39,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:39,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:39,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:39,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:44,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:44,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:00:44,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2019-09-03 20:00:44,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:44,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 130 conjunts are in the unsatisfiable core [2019-09-03 20:00:44,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:45,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:45,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 130 [2019-09-03 20:00:45,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-03 20:00:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-03 20:00:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7885, Invalid=8885, Unknown=0, NotChecked=0, Total=16770 [2019-09-03 20:00:45,151 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-09-03 20:00:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:45,726 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-09-03 20:00:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-03 20:00:45,727 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-09-03 20:00:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:45,727 INFO L225 Difference]: With dead ends: 265 [2019-09-03 20:00:45,728 INFO L226 Difference]: Without dead ends: 260 [2019-09-03 20:00:45,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7891, Invalid=9139, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:00:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-03 20:00:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-09-03 20:00:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 20:00:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-09-03 20:00:45,732 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2019-09-03 20:00:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:45,732 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-09-03 20:00:45,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-03 20:00:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-09-03 20:00:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-03 20:00:45,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:45,733 INFO L399 BasicCegarLoop]: trace histogram [124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:45,733 INFO L418 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1827432009, now seen corresponding path program 124 times [2019-09-03 20:00:45,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:45,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:45,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:45,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:45,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:51,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:51,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:51,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:00:51,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:00:51,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:51,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 131 conjunts are in the unsatisfiable core [2019-09-03 20:00:51,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:51,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:51,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:51,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 131 [2019-09-03 20:00:51,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-09-03 20:00:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-09-03 20:00:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8011, Invalid=9019, Unknown=0, NotChecked=0, Total=17030 [2019-09-03 20:00:51,496 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 131 states. [2019-09-03 20:00:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:52,070 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-09-03 20:00:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2019-09-03 20:00:52,070 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 258 [2019-09-03 20:00:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:52,071 INFO L225 Difference]: With dead ends: 267 [2019-09-03 20:00:52,071 INFO L226 Difference]: Without dead ends: 262 [2019-09-03 20:00:52,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8017, Invalid=9275, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:00:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-03 20:00:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-09-03 20:00:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-03 20:00:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-09-03 20:00:52,075 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2019-09-03 20:00:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:52,076 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-09-03 20:00:52,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-09-03 20:00:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-09-03 20:00:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-03 20:00:52,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:52,077 INFO L399 BasicCegarLoop]: trace histogram [125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:52,077 INFO L418 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 654050405, now seen corresponding path program 125 times [2019-09-03 20:00:52,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:52,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:00:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:57,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:00:57,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:00:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:00:57,979 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2019-09-03 20:00:57,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:00:57,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 132 conjunts are in the unsatisfiable core [2019-09-03 20:00:57,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:00:57,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:00:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:00:58,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:00:58,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 132 [2019-09-03 20:00:58,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-09-03 20:00:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-09-03 20:00:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8138, Invalid=9154, Unknown=0, NotChecked=0, Total=17292 [2019-09-03 20:00:58,135 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-09-03 20:00:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:00:58,422 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2019-09-03 20:00:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-09-03 20:00:58,422 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-09-03 20:00:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:00:58,423 INFO L225 Difference]: With dead ends: 269 [2019-09-03 20:00:58,423 INFO L226 Difference]: Without dead ends: 264 [2019-09-03 20:00:58,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8144, Invalid=9412, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:00:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-03 20:00:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2019-09-03 20:00:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-03 20:00:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2019-09-03 20:00:58,427 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2019-09-03 20:00:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:00:58,428 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2019-09-03 20:00:58,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-09-03 20:00:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2019-09-03 20:00:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-03 20:00:58,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:00:58,429 INFO L399 BasicCegarLoop]: trace histogram [126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:00:58,429 INFO L418 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:00:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:00:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1684239487, now seen corresponding path program 126 times [2019-09-03 20:00:58,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:00:58,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:00:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:58,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:00:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:00:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:04,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:04,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:04,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:04,436 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2019-09-03 20:01:04,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:04,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1410 conjuncts, 133 conjunts are in the unsatisfiable core [2019-09-03 20:01:04,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:04,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:04,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:04,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 133 [2019-09-03 20:01:04,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-03 20:01:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-03 20:01:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8266, Invalid=9290, Unknown=0, NotChecked=0, Total=17556 [2019-09-03 20:01:04,599 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 133 states. [2019-09-03 20:01:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:05,152 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-09-03 20:01:05,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-09-03 20:01:05,152 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 262 [2019-09-03 20:01:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:05,153 INFO L225 Difference]: With dead ends: 271 [2019-09-03 20:01:05,153 INFO L226 Difference]: Without dead ends: 266 [2019-09-03 20:01:05,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8272, Invalid=9550, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:01:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-09-03 20:01:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-09-03 20:01:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-03 20:01:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-09-03 20:01:05,159 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2019-09-03 20:01:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:05,159 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-09-03 20:01:05,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-03 20:01:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-09-03 20:01:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-03 20:01:05,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:05,160 INFO L399 BasicCegarLoop]: trace histogram [127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:05,160 INFO L418 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:05,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:05,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1782037405, now seen corresponding path program 127 times [2019-09-03 20:01:05,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:05,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:05,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:05,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:10,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:10,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:10,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:11,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 134 conjunts are in the unsatisfiable core [2019-09-03 20:01:11,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:11,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:11,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:11,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 134 [2019-09-03 20:01:11,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-09-03 20:01:11,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-09-03 20:01:11,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8395, Invalid=9427, Unknown=0, NotChecked=0, Total=17822 [2019-09-03 20:01:11,224 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-09-03 20:01:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:11,818 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-09-03 20:01:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-03 20:01:11,819 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-09-03 20:01:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:11,820 INFO L225 Difference]: With dead ends: 273 [2019-09-03 20:01:11,820 INFO L226 Difference]: Without dead ends: 268 [2019-09-03 20:01:11,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8401, Invalid=9689, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:01:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-03 20:01:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2019-09-03 20:01:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-03 20:01:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-09-03 20:01:11,824 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2019-09-03 20:01:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:11,825 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-09-03 20:01:11,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-09-03 20:01:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-09-03 20:01:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-03 20:01:11,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:11,825 INFO L399 BasicCegarLoop]: trace histogram [128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:11,826 INFO L418 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash -20491079, now seen corresponding path program 128 times [2019-09-03 20:01:11,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:11,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:11,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:11,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:11,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:17,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:17,558 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:17,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:17,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:17,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:17,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 135 conjunts are in the unsatisfiable core [2019-09-03 20:01:17,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:17,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:17,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:17,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 135 [2019-09-03 20:01:17,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-09-03 20:01:17,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-09-03 20:01:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8525, Invalid=9565, Unknown=0, NotChecked=0, Total=18090 [2019-09-03 20:01:17,911 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 135 states. [2019-09-03 20:01:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:18,450 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-09-03 20:01:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-09-03 20:01:18,450 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 266 [2019-09-03 20:01:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:18,451 INFO L225 Difference]: With dead ends: 275 [2019-09-03 20:01:18,451 INFO L226 Difference]: Without dead ends: 270 [2019-09-03 20:01:18,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8531, Invalid=9829, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:01:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-03 20:01:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-09-03 20:01:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-03 20:01:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-09-03 20:01:18,455 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2019-09-03 20:01:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:18,455 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-09-03 20:01:18,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-09-03 20:01:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-09-03 20:01:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-03 20:01:18,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:18,456 INFO L399 BasicCegarLoop]: trace histogram [129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:18,456 INFO L418 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:18,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1378543915, now seen corresponding path program 129 times [2019-09-03 20:01:18,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:18,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:18,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:18,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:18,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:24,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:24,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:24,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:01:24,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2019-09-03 20:01:24,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:24,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1443 conjuncts, 136 conjunts are in the unsatisfiable core [2019-09-03 20:01:24,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:24,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:24,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:24,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 136 [2019-09-03 20:01:24,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-09-03 20:01:24,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-09-03 20:01:24,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8656, Invalid=9704, Unknown=0, NotChecked=0, Total=18360 [2019-09-03 20:01:24,842 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-09-03 20:01:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:25,182 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2019-09-03 20:01:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-09-03 20:01:25,182 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-09-03 20:01:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:25,183 INFO L225 Difference]: With dead ends: 277 [2019-09-03 20:01:25,183 INFO L226 Difference]: Without dead ends: 272 [2019-09-03 20:01:25,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8662, Invalid=9970, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:01:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-03 20:01:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-09-03 20:01:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 20:01:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-09-03 20:01:25,186 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2019-09-03 20:01:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-09-03 20:01:25,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-09-03 20:01:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-09-03 20:01:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-03 20:01:25,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:25,188 INFO L399 BasicCegarLoop]: trace histogram [130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:25,188 INFO L418 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:25,188 INFO L82 PathProgramCache]: Analyzing trace with hash -797261327, now seen corresponding path program 130 times [2019-09-03 20:01:25,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:25,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:25,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:25,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:31,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:31,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:31,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:01:31,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:01:31,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:31,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 137 conjunts are in the unsatisfiable core [2019-09-03 20:01:31,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:31,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:31,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 137 [2019-09-03 20:01:31,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-09-03 20:01:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-09-03 20:01:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8788, Invalid=9844, Unknown=0, NotChecked=0, Total=18632 [2019-09-03 20:01:31,527 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 137 states. [2019-09-03 20:01:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:31,875 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-09-03 20:01:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-09-03 20:01:31,875 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 270 [2019-09-03 20:01:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:31,876 INFO L225 Difference]: With dead ends: 279 [2019-09-03 20:01:31,876 INFO L226 Difference]: Without dead ends: 274 [2019-09-03 20:01:31,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8794, Invalid=10112, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:01:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-03 20:01:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-09-03 20:01:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 20:01:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-09-03 20:01:31,881 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2019-09-03 20:01:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:31,881 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-09-03 20:01:31,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-09-03 20:01:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-09-03 20:01:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-03 20:01:31,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:31,882 INFO L399 BasicCegarLoop]: trace histogram [131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:31,882 INFO L418 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash -530442739, now seen corresponding path program 131 times [2019-09-03 20:01:31,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:31,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:31,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:37,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:37,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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:37,930 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:01:38,356 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2019-09-03 20:01:38,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:38,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 138 conjunts are in the unsatisfiable core [2019-09-03 20:01:38,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:38,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:38,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:38,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 138 [2019-09-03 20:01:38,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-09-03 20:01:38,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-09-03 20:01:38,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8921, Invalid=9985, Unknown=0, NotChecked=0, Total=18906 [2019-09-03 20:01:38,547 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-09-03 20:01:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:38,977 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-09-03 20:01:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-09-03 20:01:38,978 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-09-03 20:01:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:38,979 INFO L225 Difference]: With dead ends: 281 [2019-09-03 20:01:38,979 INFO L226 Difference]: Without dead ends: 276 [2019-09-03 20:01:38,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8927, Invalid=10255, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:01:38,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-03 20:01:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2019-09-03 20:01:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-03 20:01:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2019-09-03 20:01:38,983 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2019-09-03 20:01:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:38,984 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2019-09-03 20:01:38,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-09-03 20:01:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2019-09-03 20:01:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-03 20:01:38,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:38,985 INFO L399 BasicCegarLoop]: trace histogram [132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:38,985 INFO L418 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1815817431, now seen corresponding path program 132 times [2019-09-03 20:01:38,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:38,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:45,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:45,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:45,096 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:01:45,522 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2019-09-03 20:01:45,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:45,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 139 conjunts are in the unsatisfiable core [2019-09-03 20:01:45,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:45,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:45,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:45,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 139 [2019-09-03 20:01:45,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-09-03 20:01:45,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-09-03 20:01:45,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9055, Invalid=10127, Unknown=0, NotChecked=0, Total=19182 [2019-09-03 20:01:45,693 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 139 states. [2019-09-03 20:01:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:46,158 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-09-03 20:01:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2019-09-03 20:01:46,158 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 274 [2019-09-03 20:01:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:46,159 INFO L225 Difference]: With dead ends: 283 [2019-09-03 20:01:46,160 INFO L226 Difference]: Without dead ends: 278 [2019-09-03 20:01:46,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9061, Invalid=10399, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:01:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-03 20:01:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-09-03 20:01:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-03 20:01:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-09-03 20:01:46,164 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2019-09-03 20:01:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:46,165 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-09-03 20:01:46,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-09-03 20:01:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-09-03 20:01:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-03 20:01:46,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:46,165 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:46,166 INFO L418 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash -110315195, now seen corresponding path program 133 times [2019-09-03 20:01:46,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:46,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:46,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:46,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:01:46,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:52,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:52,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:52,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 140 conjunts are in the unsatisfiable core [2019-09-03 20:01:52,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:52,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:52,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 140 [2019-09-03 20:01:52,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-09-03 20:01:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-09-03 20:01:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9190, Invalid=10270, Unknown=0, NotChecked=0, Total=19460 [2019-09-03 20:01:52,715 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-09-03 20:01:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:01:53,115 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-09-03 20:01:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-03 20:01:53,116 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-09-03 20:01:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:01:53,117 INFO L225 Difference]: With dead ends: 285 [2019-09-03 20:01:53,117 INFO L226 Difference]: Without dead ends: 280 [2019-09-03 20:01:53,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9196, Invalid=10544, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:01:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-03 20:01:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2019-09-03 20:01:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 20:01:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2019-09-03 20:01:53,123 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2019-09-03 20:01:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:01:53,123 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2019-09-03 20:01:53,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-09-03 20:01:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2019-09-03 20:01:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-03 20:01:53,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:01:53,125 INFO L399 BasicCegarLoop]: trace histogram [134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:01:53,125 INFO L418 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:01:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:01:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1800173471, now seen corresponding path program 134 times [2019-09-03 20:01:53,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:01:53,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:01:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:53,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:01:53,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:01:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:01:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:59,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:01:59,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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:01:59,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:01:59,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:01:59,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:01:59,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 141 conjunts are in the unsatisfiable core [2019-09-03 20:01:59,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:01:59,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:01:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:01:59,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:01:59,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 141 [2019-09-03 20:01:59,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 141 states [2019-09-03 20:02:00,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2019-09-03 20:02:00,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9326, Invalid=10414, Unknown=0, NotChecked=0, Total=19740 [2019-09-03 20:02:00,001 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 141 states. [2019-09-03 20:02:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:00,327 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-09-03 20:02:00,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-03 20:02:00,328 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 278 [2019-09-03 20:02:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:00,328 INFO L225 Difference]: With dead ends: 287 [2019-09-03 20:02:00,328 INFO L226 Difference]: Without dead ends: 282 [2019-09-03 20:02:00,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9332, Invalid=10690, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:02:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-03 20:02:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-09-03 20:02:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 20:02:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-09-03 20:02:00,333 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2019-09-03 20:02:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:00,333 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-09-03 20:02:00,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 141 states. [2019-09-03 20:02:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-09-03 20:02:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-03 20:02:00,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:00,334 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:00,334 INFO L418 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2038628477, now seen corresponding path program 135 times [2019-09-03 20:02:00,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:00,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:06,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:06,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:06,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:07,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2019-09-03 20:02:07,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:07,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 142 conjunts are in the unsatisfiable core [2019-09-03 20:02:07,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:07,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:07,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:07,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 142 [2019-09-03 20:02:07,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-09-03 20:02:07,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-09-03 20:02:07,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9463, Invalid=10559, Unknown=0, NotChecked=0, Total=20022 [2019-09-03 20:02:07,438 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-09-03 20:02:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:07,949 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2019-09-03 20:02:07,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-03 20:02:07,949 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-09-03 20:02:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:07,950 INFO L225 Difference]: With dead ends: 289 [2019-09-03 20:02:07,951 INFO L226 Difference]: Without dead ends: 284 [2019-09-03 20:02:07,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9469, Invalid=10837, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:02:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-03 20:02:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-09-03 20:02:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-03 20:02:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-09-03 20:02:07,955 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2019-09-03 20:02:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:07,955 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-09-03 20:02:07,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-09-03 20:02:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-09-03 20:02:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-03 20:02:07,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:07,956 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:07,956 INFO L418 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:07,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:07,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1750393241, now seen corresponding path program 136 times [2019-09-03 20:02:07,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:07,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:07,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:07,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:07,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:14,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:14,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:14,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:02:14,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:02:14,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:14,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 143 conjunts are in the unsatisfiable core [2019-09-03 20:02:14,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:14,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:14,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:14,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 143 [2019-09-03 20:02:14,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-09-03 20:02:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-09-03 20:02:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9601, Invalid=10705, Unknown=0, NotChecked=0, Total=20306 [2019-09-03 20:02:14,871 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 143 states. [2019-09-03 20:02:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:15,626 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-09-03 20:02:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-09-03 20:02:15,626 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 282 [2019-09-03 20:02:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:15,627 INFO L225 Difference]: With dead ends: 291 [2019-09-03 20:02:15,627 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 20:02:15,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9607, Invalid=10985, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:02:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 20:02:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-09-03 20:02:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-03 20:02:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-09-03 20:02:15,631 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2019-09-03 20:02:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:15,631 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-09-03 20:02:15,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-09-03 20:02:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-09-03 20:02:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-03 20:02:15,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:15,632 INFO L399 BasicCegarLoop]: trace histogram [137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:15,633 INFO L418 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -365761611, now seen corresponding path program 137 times [2019-09-03 20:02:15,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:15,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:15,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:22,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:22,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:22,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:02:22,696 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2019-09-03 20:02:22,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:22,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 144 conjunts are in the unsatisfiable core [2019-09-03 20:02:22,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:22,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:22,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:22,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 144 [2019-09-03 20:02:22,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-09-03 20:02:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-09-03 20:02:22,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9740, Invalid=10852, Unknown=0, NotChecked=0, Total=20592 [2019-09-03 20:02:22,871 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-09-03 20:02:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:23,562 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2019-09-03 20:02:23,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 20:02:23,562 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-09-03 20:02:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:23,563 INFO L225 Difference]: With dead ends: 293 [2019-09-03 20:02:23,563 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 20:02:23,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9746, Invalid=11134, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:02:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 20:02:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2019-09-03 20:02:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 20:02:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-09-03 20:02:23,567 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2019-09-03 20:02:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:23,567 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-09-03 20:02:23,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-09-03 20:02:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-09-03 20:02:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-03 20:02:23,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:23,568 INFO L399 BasicCegarLoop]: trace histogram [138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:23,569 INFO L418 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1823923921, now seen corresponding path program 138 times [2019-09-03 20:02:23,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:23,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:30,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:30,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:30,278 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:02:30,740 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2019-09-03 20:02:30,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:30,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1542 conjuncts, 145 conjunts are in the unsatisfiable core [2019-09-03 20:02:30,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:30,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:30,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 145 [2019-09-03 20:02:30,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 145 states [2019-09-03 20:02:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2019-09-03 20:02:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9880, Invalid=11000, Unknown=0, NotChecked=0, Total=20880 [2019-09-03 20:02:30,915 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 145 states. [2019-09-03 20:02:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:31,434 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-09-03 20:02:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-09-03 20:02:31,435 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 286 [2019-09-03 20:02:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:31,436 INFO L225 Difference]: With dead ends: 295 [2019-09-03 20:02:31,436 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 20:02:31,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9886, Invalid=11284, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:02:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 20:02:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-09-03 20:02:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-03 20:02:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-09-03 20:02:31,441 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2019-09-03 20:02:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:31,441 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-09-03 20:02:31,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 145 states. [2019-09-03 20:02:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-09-03 20:02:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-03 20:02:31,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:31,443 INFO L399 BasicCegarLoop]: trace histogram [139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:31,443 INFO L418 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1577745133, now seen corresponding path program 139 times [2019-09-03 20:02:31,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:31,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:31,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:38,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:38,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:38,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:38,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 146 conjunts are in the unsatisfiable core [2019-09-03 20:02:38,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:38,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:38,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:38,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 146 [2019-09-03 20:02:38,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-09-03 20:02:38,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-09-03 20:02:38,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10021, Invalid=11149, Unknown=0, NotChecked=0, Total=21170 [2019-09-03 20:02:38,740 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-09-03 20:02:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:39,421 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-09-03 20:02:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2019-09-03 20:02:39,421 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-09-03 20:02:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:39,422 INFO L225 Difference]: With dead ends: 297 [2019-09-03 20:02:39,422 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 20:02:39,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10027, Invalid=11435, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:02:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 20:02:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-09-03 20:02:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-03 20:02:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-09-03 20:02:39,426 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2019-09-03 20:02:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:39,426 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-09-03 20:02:39,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-09-03 20:02:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-09-03 20:02:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-03 20:02:39,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:39,428 INFO L399 BasicCegarLoop]: trace histogram [140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:39,428 INFO L418 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1223131145, now seen corresponding path program 140 times [2019-09-03 20:02:39,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:39,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:02:39,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:46,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:46,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:46,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:02:46,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:02:46,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:46,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 147 conjunts are in the unsatisfiable core [2019-09-03 20:02:46,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:46,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:46,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 147 [2019-09-03 20:02:46,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-09-03 20:02:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-09-03 20:02:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10163, Invalid=11299, Unknown=0, NotChecked=0, Total=21462 [2019-09-03 20:02:46,723 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 147 states. [2019-09-03 20:02:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:47,478 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-09-03 20:02:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-03 20:02:47,479 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 290 [2019-09-03 20:02:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:47,480 INFO L225 Difference]: With dead ends: 299 [2019-09-03 20:02:47,480 INFO L226 Difference]: Without dead ends: 294 [2019-09-03 20:02:47,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10169, Invalid=11587, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:02:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-03 20:02:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-09-03 20:02:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-03 20:02:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-09-03 20:02:47,484 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2019-09-03 20:02:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:47,484 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-09-03 20:02:47,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-09-03 20:02:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-09-03 20:02:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-03 20:02:47,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:47,485 INFO L399 BasicCegarLoop]: trace histogram [141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:47,486 INFO L418 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash -258494939, now seen corresponding path program 141 times [2019-09-03 20:02:47,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:47,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:47,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:47,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:02:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:54,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:02:54,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:02:54,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:02:55,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2019-09-03 20:02:55,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:02:55,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 148 conjunts are in the unsatisfiable core [2019-09-03 20:02:55,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:02:55,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:02:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:02:55,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:02:55,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 148 [2019-09-03 20:02:55,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-09-03 20:02:55,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-09-03 20:02:55,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10306, Invalid=11450, Unknown=0, NotChecked=0, Total=21756 [2019-09-03 20:02:55,288 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-09-03 20:02:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:02:55,752 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-09-03 20:02:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-09-03 20:02:55,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-09-03 20:02:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:02:55,753 INFO L225 Difference]: With dead ends: 301 [2019-09-03 20:02:55,753 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:02:55,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10312, Invalid=11740, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:02:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:02:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-09-03 20:02:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 20:02:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-09-03 20:02:55,757 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2019-09-03 20:02:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:02:55,757 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-09-03 20:02:55,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-09-03 20:02:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-09-03 20:02:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-03 20:02:55,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:02:55,758 INFO L399 BasicCegarLoop]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:02:55,758 INFO L418 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:02:55,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:02:55,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1827980609, now seen corresponding path program 142 times [2019-09-03 20:02:55,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:02:55,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:02:55,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:55,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:02:55,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:02:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:02,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:02,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:02,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:03,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:03,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:03,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 149 conjunts are in the unsatisfiable core [2019-09-03 20:03:03,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:03,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:03,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:03,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 149 [2019-09-03 20:03:03,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-03 20:03:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-03 20:03:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10450, Invalid=11602, Unknown=0, NotChecked=0, Total=22052 [2019-09-03 20:03:03,267 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 149 states. [2019-09-03 20:03:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:04,065 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-09-03 20:03:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-09-03 20:03:04,065 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 294 [2019-09-03 20:03:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:04,066 INFO L225 Difference]: With dead ends: 303 [2019-09-03 20:03:04,067 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 20:03:04,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10456, Invalid=11894, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 20:03:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 20:03:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-09-03 20:03:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 20:03:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-09-03 20:03:04,072 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2019-09-03 20:03:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:04,072 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-09-03 20:03:04,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-09-03 20:03:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-09-03 20:03:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-03 20:03:04,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:04,073 INFO L399 BasicCegarLoop]: trace histogram [143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:04,074 INFO L418 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:04,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1181255005, now seen corresponding path program 143 times [2019-09-03 20:03:04,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:04,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:04,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:04,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:04,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:11,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:11,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:11,228 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:03:11,712 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2019-09-03 20:03:11,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:11,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 150 conjunts are in the unsatisfiable core [2019-09-03 20:03:11,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:11,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:11,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:11,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 150 [2019-09-03 20:03:11,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-09-03 20:03:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-09-03 20:03:11,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10595, Invalid=11755, Unknown=0, NotChecked=0, Total=22350 [2019-09-03 20:03:11,896 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-09-03 20:03:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:12,420 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-09-03 20:03:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-09-03 20:03:12,421 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-09-03 20:03:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:12,421 INFO L225 Difference]: With dead ends: 305 [2019-09-03 20:03:12,422 INFO L226 Difference]: Without dead ends: 300 [2019-09-03 20:03:12,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10601, Invalid=12049, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:03:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-03 20:03:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-09-03 20:03:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-03 20:03:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2019-09-03 20:03:12,426 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2019-09-03 20:03:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:12,426 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2019-09-03 20:03:12,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-09-03 20:03:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2019-09-03 20:03:12,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-03 20:03:12,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:12,427 INFO L399 BasicCegarLoop]: trace histogram [144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:12,428 INFO L418 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:12,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1846759815, now seen corresponding path program 144 times [2019-09-03 20:03:12,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:12,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:12,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:12,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:19,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:19,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:19,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:03:20,252 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2019-09-03 20:03:20,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:20,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-03 20:03:20,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:20,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:20,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:20,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 151 [2019-09-03 20:03:20,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 151 states [2019-09-03 20:03:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2019-09-03 20:03:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10741, Invalid=11909, Unknown=0, NotChecked=0, Total=22650 [2019-09-03 20:03:20,440 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 151 states. [2019-09-03 20:03:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:21,318 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-09-03 20:03:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-03 20:03:21,318 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 298 [2019-09-03 20:03:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:21,320 INFO L225 Difference]: With dead ends: 307 [2019-09-03 20:03:21,320 INFO L226 Difference]: Without dead ends: 302 [2019-09-03 20:03:21,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10747, Invalid=12205, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 20:03:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-03 20:03:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-09-03 20:03:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-03 20:03:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-09-03 20:03:21,326 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2019-09-03 20:03:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:21,327 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-09-03 20:03:21,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 151 states. [2019-09-03 20:03:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-09-03 20:03:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-03 20:03:21,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:21,328 INFO L399 BasicCegarLoop]: trace histogram [145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:21,328 INFO L418 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash 218824853, now seen corresponding path program 145 times [2019-09-03 20:03:21,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:21,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:21,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:21,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:21,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:28,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:28,811 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:28,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:29,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1619 conjuncts, 152 conjunts are in the unsatisfiable core [2019-09-03 20:03:29,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:29,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:29,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 152 [2019-09-03 20:03:29,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-09-03 20:03:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-09-03 20:03:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10888, Invalid=12064, Unknown=0, NotChecked=0, Total=22952 [2019-09-03 20:03:29,236 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-09-03 20:03:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:30,158 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2019-09-03 20:03:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-09-03 20:03:30,159 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-09-03 20:03:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:30,160 INFO L225 Difference]: With dead ends: 309 [2019-09-03 20:03:30,160 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 20:03:30,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10894, Invalid=12362, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:03:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 20:03:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2019-09-03 20:03:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-03 20:03:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2019-09-03 20:03:30,164 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2019-09-03 20:03:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:30,165 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2019-09-03 20:03:30,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-09-03 20:03:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2019-09-03 20:03:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-03 20:03:30,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:30,166 INFO L399 BasicCegarLoop]: trace histogram [146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:30,166 INFO L418 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash 970800049, now seen corresponding path program 146 times [2019-09-03 20:03:30,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:30,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:30,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:30,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:03:30,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:37,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:37,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:37,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:03:37,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:03:37,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:37,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 153 conjunts are in the unsatisfiable core [2019-09-03 20:03:37,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:37,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:38,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:38,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 153 [2019-09-03 20:03:38,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 153 states [2019-09-03 20:03:38,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2019-09-03 20:03:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11036, Invalid=12220, Unknown=0, NotChecked=0, Total=23256 [2019-09-03 20:03:38,027 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 153 states. [2019-09-03 20:03:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:38,508 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-09-03 20:03:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2019-09-03 20:03:38,508 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 302 [2019-09-03 20:03:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:38,509 INFO L225 Difference]: With dead ends: 311 [2019-09-03 20:03:38,509 INFO L226 Difference]: Without dead ends: 306 [2019-09-03 20:03:38,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11042, Invalid=12520, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:03:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-03 20:03:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-09-03 20:03:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-03 20:03:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-09-03 20:03:38,513 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2019-09-03 20:03:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:38,513 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-09-03 20:03:38,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 153 states. [2019-09-03 20:03:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-09-03 20:03:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-03 20:03:38,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:38,514 INFO L399 BasicCegarLoop]: trace histogram [147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:38,515 INFO L418 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2064457677, now seen corresponding path program 147 times [2019-09-03 20:03:38,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:38,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:38,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:38,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:46,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:46,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:46,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:03:46,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2019-09-03 20:03:46,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:46,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 154 conjunts are in the unsatisfiable core [2019-09-03 20:03:46,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21609 backedges. 0 proven. 21609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:46,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:46,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 154 [2019-09-03 20:03:46,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-09-03 20:03:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-09-03 20:03:46,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11185, Invalid=12377, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 20:03:46,791 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-09-03 20:03:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:47,491 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2019-09-03 20:03:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-03 20:03:47,492 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-09-03 20:03:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:47,493 INFO L225 Difference]: With dead ends: 313 [2019-09-03 20:03:47,493 INFO L226 Difference]: Without dead ends: 308 [2019-09-03 20:03:47,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11191, Invalid=12679, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 20:03:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-03 20:03:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2019-09-03 20:03:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-03 20:03:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-09-03 20:03:47,498 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2019-09-03 20:03:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:47,498 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-09-03 20:03:47,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-09-03 20:03:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-09-03 20:03:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-03 20:03:47,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:47,499 INFO L399 BasicCegarLoop]: trace histogram [148, 148, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:47,499 INFO L418 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 802450665, now seen corresponding path program 148 times [2019-09-03 20:03:47,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:47,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:47,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:47,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:03:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:55,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:03:55,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:03:55,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:03:55,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:03:55,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:03:55,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1652 conjuncts, 155 conjunts are in the unsatisfiable core [2019-09-03 20:03:55,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:03:55,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:03:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21904 backedges. 0 proven. 21904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:03:55,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:03:55,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 155 [2019-09-03 20:03:55,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-09-03 20:03:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-09-03 20:03:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11335, Invalid=12535, Unknown=0, NotChecked=0, Total=23870 [2019-09-03 20:03:55,809 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 155 states. [2019-09-03 20:03:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:03:56,675 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-09-03 20:03:56,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-03 20:03:56,676 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 306 [2019-09-03 20:03:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:03:56,677 INFO L225 Difference]: With dead ends: 315 [2019-09-03 20:03:56,677 INFO L226 Difference]: Without dead ends: 310 [2019-09-03 20:03:56,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11341, Invalid=12839, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:03:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-03 20:03:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-09-03 20:03:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-03 20:03:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-09-03 20:03:56,682 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2019-09-03 20:03:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:03:56,682 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-09-03 20:03:56,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-09-03 20:03:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-09-03 20:03:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-03 20:03:56,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:03:56,683 INFO L399 BasicCegarLoop]: trace histogram [149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:03:56,683 INFO L418 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:03:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:03:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash -805510395, now seen corresponding path program 149 times [2019-09-03 20:03:56,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:03:56,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:03:56,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:56,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:03:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:03:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:04,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:04:05,024 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2019-09-03 20:04:05,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:05,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 156 conjunts are in the unsatisfiable core [2019-09-03 20:04:05,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:05,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 22201 backedges. 0 proven. 22201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:05,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 156 [2019-09-03 20:04:05,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-09-03 20:04:05,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-09-03 20:04:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11486, Invalid=12694, Unknown=0, NotChecked=0, Total=24180 [2019-09-03 20:04:05,219 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-09-03 20:04:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:06,260 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2019-09-03 20:04:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-09-03 20:04:06,260 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-09-03 20:04:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:06,261 INFO L225 Difference]: With dead ends: 317 [2019-09-03 20:04:06,261 INFO L226 Difference]: Without dead ends: 312 [2019-09-03 20:04:06,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11492, Invalid=13000, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 20:04:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-03 20:04:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 311. [2019-09-03 20:04:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-03 20:04:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-09-03 20:04:06,267 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2019-09-03 20:04:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:06,267 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-09-03 20:04:06,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-09-03 20:04:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-09-03 20:04:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-03 20:04:06,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:06,269 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:06,269 INFO L418 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:06,269 INFO L82 PathProgramCache]: Analyzing trace with hash 132137505, now seen corresponding path program 150 times [2019-09-03 20:04:06,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:06,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:06,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:06,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:14,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:14,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:14,437 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:04:14,962 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2019-09-03 20:04:14,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:14,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 157 conjunts are in the unsatisfiable core [2019-09-03 20:04:14,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22500 backedges. 0 proven. 22500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:15,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:15,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 157 [2019-09-03 20:04:15,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-09-03 20:04:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-09-03 20:04:15,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11638, Invalid=12854, Unknown=0, NotChecked=0, Total=24492 [2019-09-03 20:04:15,159 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 157 states. [2019-09-03 20:04:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:16,255 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-09-03 20:04:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-09-03 20:04:16,255 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 310 [2019-09-03 20:04:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:16,256 INFO L225 Difference]: With dead ends: 319 [2019-09-03 20:04:16,256 INFO L226 Difference]: Without dead ends: 314 [2019-09-03 20:04:16,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11644, Invalid=13162, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:04:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-03 20:04:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-09-03 20:04:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-03 20:04:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-09-03 20:04:16,261 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2019-09-03 20:04:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:16,261 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-09-03 20:04:16,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-09-03 20:04:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-09-03 20:04:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-03 20:04:16,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:16,263 INFO L399 BasicCegarLoop]: trace histogram [151, 151, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:16,263 INFO L418 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -731362755, now seen corresponding path program 151 times [2019-09-03 20:04:16,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:16,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:24,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:24,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:24,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:24,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 158 conjunts are in the unsatisfiable core [2019-09-03 20:04:24,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:24,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22801 backedges. 0 proven. 22801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:24,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:24,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 158 [2019-09-03 20:04:24,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-09-03 20:04:24,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-09-03 20:04:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11791, Invalid=13015, Unknown=0, NotChecked=0, Total=24806 [2019-09-03 20:04:24,613 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-09-03 20:04:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:25,729 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-09-03 20:04:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-03 20:04:25,729 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-09-03 20:04:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:25,730 INFO L225 Difference]: With dead ends: 321 [2019-09-03 20:04:25,730 INFO L226 Difference]: Without dead ends: 316 [2019-09-03 20:04:25,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11797, Invalid=13325, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:04:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-03 20:04:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-09-03 20:04:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-03 20:04:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2019-09-03 20:04:25,734 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2019-09-03 20:04:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:25,734 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2019-09-03 20:04:25,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-09-03 20:04:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2019-09-03 20:04:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-03 20:04:25,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:25,735 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:25,736 INFO L418 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1626424487, now seen corresponding path program 152 times [2019-09-03 20:04:25,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:25,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:25,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:25,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:04:25,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:33,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:33,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:33,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:04:33,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:04:33,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:33,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 159 conjunts are in the unsatisfiable core [2019-09-03 20:04:33,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:34,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23104 backedges. 0 proven. 23104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 159 [2019-09-03 20:04:34,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-09-03 20:04:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-09-03 20:04:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11945, Invalid=13177, Unknown=0, NotChecked=0, Total=25122 [2019-09-03 20:04:34,195 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 159 states. [2019-09-03 20:04:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:35,294 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-09-03 20:04:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-03 20:04:35,294 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 314 [2019-09-03 20:04:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:35,295 INFO L225 Difference]: With dead ends: 323 [2019-09-03 20:04:35,295 INFO L226 Difference]: Without dead ends: 318 [2019-09-03 20:04:35,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11951, Invalid=13489, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:04:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-03 20:04:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-09-03 20:04:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-03 20:04:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-09-03 20:04:35,301 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2019-09-03 20:04:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:35,301 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-09-03 20:04:35,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-09-03 20:04:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-09-03 20:04:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-03 20:04:35,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:35,303 INFO L399 BasicCegarLoop]: trace histogram [153, 153, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:35,303 INFO L418 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1507677557, now seen corresponding path program 153 times [2019-09-03 20:04:35,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:35,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:43,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:43,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:43,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:04:44,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 154 check-sat command(s) [2019-09-03 20:04:44,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:44,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 1707 conjuncts, 160 conjunts are in the unsatisfiable core [2019-09-03 20:04:44,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23409 backedges. 0 proven. 23409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:44,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:44,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 160 [2019-09-03 20:04:44,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-09-03 20:04:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-09-03 20:04:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12100, Invalid=13340, Unknown=0, NotChecked=0, Total=25440 [2019-09-03 20:04:44,256 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-09-03 20:04:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:45,416 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-09-03 20:04:45,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-03 20:04:45,416 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-09-03 20:04:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:45,417 INFO L225 Difference]: With dead ends: 325 [2019-09-03 20:04:45,417 INFO L226 Difference]: Without dead ends: 320 [2019-09-03 20:04:45,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12106, Invalid=13654, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 20:04:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-03 20:04:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-09-03 20:04:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-03 20:04:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2019-09-03 20:04:45,422 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2019-09-03 20:04:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:45,422 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2019-09-03 20:04:45,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-09-03 20:04:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2019-09-03 20:04:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-03 20:04:45,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:45,424 INFO L399 BasicCegarLoop]: trace histogram [154, 154, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:45,424 INFO L418 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:45,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:45,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1687299951, now seen corresponding path program 154 times [2019-09-03 20:04:45,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:45,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:45,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:45,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:45,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:04:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:53,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:04:53,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:04:53,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:04:53,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:04:53,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:04:53,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1718 conjuncts, 161 conjunts are in the unsatisfiable core [2019-09-03 20:04:53,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:04:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:04:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23716 backedges. 0 proven. 23716 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:04:54,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:04:54,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 161 [2019-09-03 20:04:54,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-09-03 20:04:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-09-03 20:04:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12256, Invalid=13504, Unknown=0, NotChecked=0, Total=25760 [2019-09-03 20:04:54,109 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 161 states. [2019-09-03 20:04:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:04:55,241 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-09-03 20:04:55,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-03 20:04:55,242 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 318 [2019-09-03 20:04:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:04:55,243 INFO L225 Difference]: With dead ends: 327 [2019-09-03 20:04:55,243 INFO L226 Difference]: Without dead ends: 322 [2019-09-03 20:04:55,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12262, Invalid=13820, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:04:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-03 20:04:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-09-03 20:04:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-03 20:04:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-09-03 20:04:55,249 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2019-09-03 20:04:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:04:55,249 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-09-03 20:04:55,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-09-03 20:04:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-09-03 20:04:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-03 20:04:55,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:04:55,251 INFO L399 BasicCegarLoop]: trace histogram [155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:04:55,251 INFO L418 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:04:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:04:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1159068499, now seen corresponding path program 155 times [2019-09-03 20:04:55,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:04:55,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:04:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:55,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:04:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:04:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:03,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:03,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 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:05:04,342 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2019-09-03 20:05:04,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:04,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 162 conjunts are in the unsatisfiable core [2019-09-03 20:05:04,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:04,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24025 backedges. 0 proven. 24025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:04,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:04,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 162 [2019-09-03 20:05:04,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-09-03 20:05:04,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-09-03 20:05:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12413, Invalid=13669, Unknown=0, NotChecked=0, Total=26082 [2019-09-03 20:05:04,543 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-09-03 20:05:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:05,633 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2019-09-03 20:05:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2019-09-03 20:05:05,633 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-09-03 20:05:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:05,634 INFO L225 Difference]: With dead ends: 329 [2019-09-03 20:05:05,634 INFO L226 Difference]: Without dead ends: 324 [2019-09-03 20:05:05,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12419, Invalid=13987, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:05:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-03 20:05:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2019-09-03 20:05:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-03 20:05:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2019-09-03 20:05:05,638 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2019-09-03 20:05:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:05,638 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2019-09-03 20:05:05,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-09-03 20:05:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2019-09-03 20:05:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-03 20:05:05,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:05,640 INFO L399 BasicCegarLoop]: trace histogram [156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:05,640 INFO L418 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:05,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash -334784055, now seen corresponding path program 156 times [2019-09-03 20:05:05,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:05,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:05,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:05,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:14,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:14,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:05:14,630 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 157 check-sat command(s) [2019-09-03 20:05:14,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:14,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 163 conjunts are in the unsatisfiable core [2019-09-03 20:05:14,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:14,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24336 backedges. 0 proven. 24336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:14,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:14,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 163 [2019-09-03 20:05:14,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-09-03 20:05:14,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-09-03 20:05:14,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12571, Invalid=13835, Unknown=0, NotChecked=0, Total=26406 [2019-09-03 20:05:14,837 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 163 states. [2019-09-03 20:05:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:15,517 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-09-03 20:05:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-03 20:05:15,518 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 322 [2019-09-03 20:05:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:15,519 INFO L225 Difference]: With dead ends: 331 [2019-09-03 20:05:15,519 INFO L226 Difference]: Without dead ends: 326 [2019-09-03 20:05:15,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12577, Invalid=14155, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:05:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-03 20:05:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-09-03 20:05:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-03 20:05:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-09-03 20:05:15,523 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2019-09-03 20:05:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:15,524 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-09-03 20:05:15,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-09-03 20:05:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-09-03 20:05:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-03 20:05:15,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:15,525 INFO L399 BasicCegarLoop]: trace histogram [157, 157, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:15,525 INFO L418 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1528584165, now seen corresponding path program 157 times [2019-09-03 20:05:15,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:15,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:24,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:24,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:24,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1751 conjuncts, 164 conjunts are in the unsatisfiable core [2019-09-03 20:05:24,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:24,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 24649 backedges. 0 proven. 24649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:24,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:24,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 164 [2019-09-03 20:05:24,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-09-03 20:05:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-09-03 20:05:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12730, Invalid=14002, Unknown=0, NotChecked=0, Total=26732 [2019-09-03 20:05:24,656 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-09-03 20:05:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:25,316 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2019-09-03 20:05:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2019-09-03 20:05:25,317 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-09-03 20:05:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:25,318 INFO L225 Difference]: With dead ends: 333 [2019-09-03 20:05:25,318 INFO L226 Difference]: Without dead ends: 328 [2019-09-03 20:05:25,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12736, Invalid=14324, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:05:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-03 20:05:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2019-09-03 20:05:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-03 20:05:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-09-03 20:05:25,323 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2019-09-03 20:05:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:25,323 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-09-03 20:05:25,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-09-03 20:05:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-09-03 20:05:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-03 20:05:25,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:25,324 INFO L399 BasicCegarLoop]: trace histogram [158, 158, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:25,324 INFO L418 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1224081153, now seen corresponding path program 158 times [2019-09-03 20:05:25,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:25,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:25,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:25,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:05:25,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:34,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:34,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:34,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:05:34,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:05:34,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:34,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 165 conjunts are in the unsatisfiable core [2019-09-03 20:05:34,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:34,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24964 backedges. 0 proven. 24964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:34,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:34,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 165 [2019-09-03 20:05:34,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 165 states [2019-09-03 20:05:34,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2019-09-03 20:05:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12890, Invalid=14170, Unknown=0, NotChecked=0, Total=27060 [2019-09-03 20:05:34,505 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 165 states. [2019-09-03 20:05:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:35,747 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-09-03 20:05:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-03 20:05:35,747 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 326 [2019-09-03 20:05:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:35,748 INFO L225 Difference]: With dead ends: 335 [2019-09-03 20:05:35,748 INFO L226 Difference]: Without dead ends: 330 [2019-09-03 20:05:35,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12896, Invalid=14494, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 20:05:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-03 20:05:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-09-03 20:05:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-03 20:05:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-09-03 20:05:35,754 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2019-09-03 20:05:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:35,754 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-09-03 20:05:35,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 165 states. [2019-09-03 20:05:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-09-03 20:05:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-03 20:05:35,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:35,755 INFO L399 BasicCegarLoop]: trace histogram [159, 159, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:35,755 INFO L418 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:35,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:35,755 INFO L82 PathProgramCache]: Analyzing trace with hash 654462749, now seen corresponding path program 159 times [2019-09-03 20:05:35,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:35,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:35,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:35,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:35,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:44,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:44,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:44,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:05:45,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 160 check-sat command(s) [2019-09-03 20:05:45,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:45,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 166 conjunts are in the unsatisfiable core [2019-09-03 20:05:45,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25281 backedges. 0 proven. 25281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:45,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:45,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164] total 166 [2019-09-03 20:05:45,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-09-03 20:05:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-09-03 20:05:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13051, Invalid=14339, Unknown=0, NotChecked=0, Total=27390 [2019-09-03 20:05:45,326 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-09-03 20:05:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:46,277 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2019-09-03 20:05:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-09-03 20:05:46,278 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-09-03 20:05:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:46,279 INFO L225 Difference]: With dead ends: 337 [2019-09-03 20:05:46,279 INFO L226 Difference]: Without dead ends: 332 [2019-09-03 20:05:46,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13057, Invalid=14665, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:05:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-03 20:05:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2019-09-03 20:05:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-03 20:05:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-09-03 20:05:46,284 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2019-09-03 20:05:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:46,284 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-09-03 20:05:46,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-09-03 20:05:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-09-03 20:05:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-03 20:05:46,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:46,285 INFO L399 BasicCegarLoop]: trace histogram [160, 160, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:46,285 INFO L418 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:46,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1287976903, now seen corresponding path program 160 times [2019-09-03 20:05:46,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:46,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:46,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:05:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:55,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:05:55,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:05:55,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:05:55,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:05:55,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:05:55,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 167 conjunts are in the unsatisfiable core [2019-09-03 20:05:55,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:05:55,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:05:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25600 backedges. 0 proven. 25600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:05:55,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:05:55,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 167 [2019-09-03 20:05:55,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 167 states [2019-09-03 20:05:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2019-09-03 20:05:55,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13213, Invalid=14509, Unknown=0, NotChecked=0, Total=27722 [2019-09-03 20:05:55,725 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 167 states. [2019-09-03 20:05:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:05:56,686 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-09-03 20:05:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-09-03 20:05:56,686 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 330 [2019-09-03 20:05:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:05:56,687 INFO L225 Difference]: With dead ends: 339 [2019-09-03 20:05:56,687 INFO L226 Difference]: Without dead ends: 334 [2019-09-03 20:05:56,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13219, Invalid=14837, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:05:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-03 20:05:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-09-03 20:05:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-03 20:05:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-09-03 20:05:56,693 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2019-09-03 20:05:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:05:56,694 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-09-03 20:05:56,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 167 states. [2019-09-03 20:05:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-09-03 20:05:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-03 20:05:56,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:05:56,695 INFO L399 BasicCegarLoop]: trace histogram [161, 161, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:05:56,695 INFO L418 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:05:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:05:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 338291285, now seen corresponding path program 161 times [2019-09-03 20:05:56,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:05:56,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:05:56,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:56,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:05:56,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:05:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:05,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:05,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:05,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:06:06,410 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 162 check-sat command(s) [2019-09-03 20:06:06,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:06,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 168 conjunts are in the unsatisfiable core [2019-09-03 20:06:06,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:06,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 25921 backedges. 0 proven. 25921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:06,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:06,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166, 166] total 168 [2019-09-03 20:06:06,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-09-03 20:06:06,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-09-03 20:06:06,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13376, Invalid=14680, Unknown=0, NotChecked=0, Total=28056 [2019-09-03 20:06:06,618 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-09-03 20:06:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:07,844 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-09-03 20:06:07,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-09-03 20:06:07,845 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-09-03 20:06:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:07,845 INFO L225 Difference]: With dead ends: 341 [2019-09-03 20:06:07,846 INFO L226 Difference]: Without dead ends: 336 [2019-09-03 20:06:07,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13382, Invalid=15010, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:06:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-03 20:06:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-09-03 20:06:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-03 20:06:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2019-09-03 20:06:07,851 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2019-09-03 20:06:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:07,852 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2019-09-03 20:06:07,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-09-03 20:06:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2019-09-03 20:06:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-03 20:06:07,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:07,854 INFO L399 BasicCegarLoop]: trace histogram [162, 162, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:07,854 INFO L418 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -186075791, now seen corresponding path program 162 times [2019-09-03 20:06:07,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:07,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:07,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:07,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:07,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:16,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:16,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:06:17,467 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 163 check-sat command(s) [2019-09-03 20:06:17,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:17,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1806 conjuncts, 169 conjunts are in the unsatisfiable core [2019-09-03 20:06:17,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26244 backedges. 0 proven. 26244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:17,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 169 [2019-09-03 20:06:17,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 169 states [2019-09-03 20:06:17,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2019-09-03 20:06:17,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13540, Invalid=14852, Unknown=0, NotChecked=0, Total=28392 [2019-09-03 20:06:17,680 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 169 states. [2019-09-03 20:06:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:18,686 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-09-03 20:06:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-03 20:06:18,687 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 334 [2019-09-03 20:06:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:18,687 INFO L225 Difference]: With dead ends: 343 [2019-09-03 20:06:18,687 INFO L226 Difference]: Without dead ends: 338 [2019-09-03 20:06:18,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13546, Invalid=15184, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 20:06:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-03 20:06:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-09-03 20:06:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-03 20:06:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-09-03 20:06:18,691 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2019-09-03 20:06:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:18,691 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-09-03 20:06:18,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 169 states. [2019-09-03 20:06:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-09-03 20:06:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-03 20:06:18,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:18,692 INFO L399 BasicCegarLoop]: trace histogram [163, 163, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:18,693 INFO L418 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1591662195, now seen corresponding path program 163 times [2019-09-03 20:06:18,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:18,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:18,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:18,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:27,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:27,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:27,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:06:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:28,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1817 conjuncts, 170 conjunts are in the unsatisfiable core [2019-09-03 20:06:28,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:28,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26569 backedges. 0 proven. 26569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:28,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:28,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168, 168] total 170 [2019-09-03 20:06:28,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-09-03 20:06:28,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-09-03 20:06:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13705, Invalid=15025, Unknown=0, NotChecked=0, Total=28730 [2019-09-03 20:06:28,380 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-09-03 20:06:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:29,514 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-09-03 20:06:29,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-03 20:06:29,514 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-09-03 20:06:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:29,515 INFO L225 Difference]: With dead ends: 345 [2019-09-03 20:06:29,516 INFO L226 Difference]: Without dead ends: 340 [2019-09-03 20:06:29,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13711, Invalid=15359, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:06:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-09-03 20:06:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2019-09-03 20:06:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-03 20:06:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2019-09-03 20:06:29,522 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2019-09-03 20:06:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:29,522 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2019-09-03 20:06:29,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-09-03 20:06:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2019-09-03 20:06:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-03 20:06:29,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:29,524 INFO L399 BasicCegarLoop]: trace histogram [164, 164, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:29,524 INFO L418 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 554501801, now seen corresponding path program 164 times [2019-09-03 20:06:29,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:29,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:06:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:38,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:38,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:38,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:06:39,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:06:39,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:39,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1828 conjuncts, 171 conjunts are in the unsatisfiable core [2019-09-03 20:06:39,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26896 backedges. 0 proven. 26896 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:39,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:39,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 171 [2019-09-03 20:06:39,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-09-03 20:06:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-09-03 20:06:39,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13871, Invalid=15199, Unknown=0, NotChecked=0, Total=29070 [2019-09-03 20:06:39,357 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 171 states. [2019-09-03 20:06:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:40,887 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-09-03 20:06:40,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-09-03 20:06:40,888 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 338 [2019-09-03 20:06:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:40,888 INFO L225 Difference]: With dead ends: 347 [2019-09-03 20:06:40,888 INFO L226 Difference]: Without dead ends: 342 [2019-09-03 20:06:40,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13877, Invalid=15535, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:06:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-03 20:06:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-09-03 20:06:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-03 20:06:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-09-03 20:06:40,893 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2019-09-03 20:06:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:40,894 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-09-03 20:06:40,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-09-03 20:06:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-09-03 20:06:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-03 20:06:40,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:40,895 INFO L399 BasicCegarLoop]: trace histogram [165, 165, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:40,895 INFO L418 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1433799877, now seen corresponding path program 165 times [2019-09-03 20:06:40,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:40,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:40,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:40,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:40,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:06:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:50,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:06:50,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:06:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:06:50,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 166 check-sat command(s) [2019-09-03 20:06:50,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:06:50,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1839 conjuncts, 172 conjunts are in the unsatisfiable core [2019-09-03 20:06:50,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:06:50,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:06:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27225 backedges. 0 proven. 27225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:06:51,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:06:51,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170, 170] total 172 [2019-09-03 20:06:51,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-09-03 20:06:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-09-03 20:06:51,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14038, Invalid=15374, Unknown=0, NotChecked=0, Total=29412 [2019-09-03 20:06:51,152 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-09-03 20:06:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:06:51,775 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2019-09-03 20:06:51,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2019-09-03 20:06:51,776 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-09-03 20:06:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:06:51,776 INFO L225 Difference]: With dead ends: 349 [2019-09-03 20:06:51,776 INFO L226 Difference]: Without dead ends: 344 [2019-09-03 20:06:51,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14044, Invalid=15712, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:06:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-03 20:06:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2019-09-03 20:06:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-03 20:06:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2019-09-03 20:06:51,783 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2019-09-03 20:06:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:06:51,783 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2019-09-03 20:06:51,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-09-03 20:06:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2019-09-03 20:06:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-03 20:06:51,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:06:51,784 INFO L399 BasicCegarLoop]: trace histogram [166, 166, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:06:51,784 INFO L418 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:06:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:06:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash 330693601, now seen corresponding path program 166 times [2019-09-03 20:06:51,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:06:51,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:06:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:51,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:06:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:06:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:01,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:01,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:01,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 20:07:01,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 20:07:01,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:01,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 173 conjunts are in the unsatisfiable core [2019-09-03 20:07:01,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:01,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 27556 backedges. 0 proven. 27556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:01,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:01,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 173 [2019-09-03 20:07:01,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 173 states [2019-09-03 20:07:01,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2019-09-03 20:07:01,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14206, Invalid=15550, Unknown=0, NotChecked=0, Total=29756 [2019-09-03 20:07:01,717 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 173 states. [2019-09-03 20:07:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:02,792 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-09-03 20:07:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2019-09-03 20:07:02,793 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 342 [2019-09-03 20:07:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:02,794 INFO L225 Difference]: With dead ends: 351 [2019-09-03 20:07:02,794 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 20:07:02,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=14212, Invalid=15890, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 20:07:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 20:07:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-09-03 20:07:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-03 20:07:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-09-03 20:07:02,799 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2019-09-03 20:07:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:02,799 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-09-03 20:07:02,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 173 states. [2019-09-03 20:07:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-09-03 20:07:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-03 20:07:02,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:02,801 INFO L399 BasicCegarLoop]: trace histogram [167, 167, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:02,801 INFO L418 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:02,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1102484477, now seen corresponding path program 167 times [2019-09-03 20:07:02,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:02,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:02,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:02,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:12,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:12,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 20:07:13,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 168 check-sat command(s) [2019-09-03 20:07:13,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:13,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 174 conjunts are in the unsatisfiable core [2019-09-03 20:07:13,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:13,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27889 backedges. 0 proven. 27889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172] total 174 [2019-09-03 20:07:13,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-09-03 20:07:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-09-03 20:07:13,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14375, Invalid=15727, Unknown=0, NotChecked=0, Total=30102 [2019-09-03 20:07:13,338 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-09-03 20:07:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:14,722 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2019-09-03 20:07:14,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-03 20:07:14,722 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-09-03 20:07:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:14,723 INFO L225 Difference]: With dead ends: 353 [2019-09-03 20:07:14,723 INFO L226 Difference]: Without dead ends: 348 [2019-09-03 20:07:14,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14381, Invalid=16069, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 20:07:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-03 20:07:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2019-09-03 20:07:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-03 20:07:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-09-03 20:07:14,728 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2019-09-03 20:07:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:14,728 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-09-03 20:07:14,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-09-03 20:07:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-09-03 20:07:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-09-03 20:07:14,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:14,730 INFO L399 BasicCegarLoop]: trace histogram [168, 168, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:14,730 INFO L418 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:14,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash -235825895, now seen corresponding path program 168 times [2019-09-03 20:07:14,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:14,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:14,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:14,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:14,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:24,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:24,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:24,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 20:07:25,097 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 169 check-sat command(s) [2019-09-03 20:07:25,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:25,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1872 conjuncts, 175 conjunts are in the unsatisfiable core [2019-09-03 20:07:25,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:25,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28224 backedges. 0 proven. 28224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:25,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:25,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173, 173] total 175 [2019-09-03 20:07:25,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 175 states [2019-09-03 20:07:25,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2019-09-03 20:07:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14545, Invalid=15905, Unknown=0, NotChecked=0, Total=30450 [2019-09-03 20:07:25,325 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 175 states. [2019-09-03 20:07:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:26,817 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-09-03 20:07:26,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-03 20:07:26,818 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 346 [2019-09-03 20:07:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:26,818 INFO L225 Difference]: With dead ends: 355 [2019-09-03 20:07:26,818 INFO L226 Difference]: Without dead ends: 350 [2019-09-03 20:07:26,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14551, Invalid=16249, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:07:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-03 20:07:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-09-03 20:07:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-09-03 20:07:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-09-03 20:07:26,824 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2019-09-03 20:07:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:26,824 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-09-03 20:07:26,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 175 states. [2019-09-03 20:07:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-09-03 20:07:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-03 20:07:26,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:26,826 INFO L399 BasicCegarLoop]: trace histogram [169, 169, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:26,826 INFO L418 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2138095413, now seen corresponding path program 169 times [2019-09-03 20:07:26,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:26,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:26,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:26,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:36,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:36,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:36,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:36,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 176 conjunts are in the unsatisfiable core [2019-09-03 20:07:36,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:36,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 28561 backedges. 0 proven. 28561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:37,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:37,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174, 174] total 176 [2019-09-03 20:07:37,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-09-03 20:07:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-09-03 20:07:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14716, Invalid=16084, Unknown=0, NotChecked=0, Total=30800 [2019-09-03 20:07:37,119 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-09-03 20:07:38,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:38,111 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2019-09-03 20:07:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-09-03 20:07:38,112 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-09-03 20:07:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:38,112 INFO L225 Difference]: With dead ends: 357 [2019-09-03 20:07:38,112 INFO L226 Difference]: Without dead ends: 352 [2019-09-03 20:07:38,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14722, Invalid=16430, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 20:07:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-03 20:07:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-09-03 20:07:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-03 20:07:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-09-03 20:07:38,117 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2019-09-03 20:07:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:38,118 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-09-03 20:07:38,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-09-03 20:07:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-09-03 20:07:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-03 20:07:38,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:38,119 INFO L399 BasicCegarLoop]: trace histogram [170, 170, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:38,119 INFO L418 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1446129071, now seen corresponding path program 170 times [2019-09-03 20:07:38,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:38,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:38,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:38,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:07:38,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:48,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:48,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:07:48,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:07:48,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:07:48,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1894 conjuncts, 177 conjunts are in the unsatisfiable core [2019-09-03 20:07:48,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:07:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:07:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28900 backedges. 0 proven. 28900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:48,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:07:48,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175, 175] total 177 [2019-09-03 20:07:48,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 177 states [2019-09-03 20:07:48,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2019-09-03 20:07:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14888, Invalid=16264, Unknown=0, NotChecked=0, Total=31152 [2019-09-03 20:07:48,579 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 177 states. [2019-09-03 20:07:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:07:49,386 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-09-03 20:07:49,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2019-09-03 20:07:49,386 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 350 [2019-09-03 20:07:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:07:49,387 INFO L225 Difference]: With dead ends: 359 [2019-09-03 20:07:49,387 INFO L226 Difference]: Without dead ends: 354 [2019-09-03 20:07:49,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14894, Invalid=16612, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 20:07:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-03 20:07:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-09-03 20:07:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-03 20:07:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-09-03 20:07:49,392 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2019-09-03 20:07:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:07:49,392 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-09-03 20:07:49,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 177 states. [2019-09-03 20:07:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-09-03 20:07:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-03 20:07:49,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:07:49,393 INFO L399 BasicCegarLoop]: trace histogram [171, 171, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:07:49,393 INFO L418 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:07:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:07:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1322086803, now seen corresponding path program 171 times [2019-09-03 20:07:49,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:07:49,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:07:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:49,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:07:49,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:07:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:07:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:07:59,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:07:59,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:07:59,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:08:00,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 172 check-sat command(s) [2019-09-03 20:08:00,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:08:00,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1905 conjuncts, 178 conjunts are in the unsatisfiable core [2019-09-03 20:08:00,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:08:00,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:08:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 29241 backedges. 0 proven. 29241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 20:08:00,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176, 176] total 178 [2019-09-03 20:08:00,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-09-03 20:08:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-09-03 20:08:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15061, Invalid=16445, Unknown=0, NotChecked=0, Total=31506 [2019-09-03 20:08:00,269 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-09-03 20:08:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:08:01,028 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-09-03 20:08:01,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2019-09-03 20:08:01,028 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-09-03 20:08:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:08:01,028 INFO L225 Difference]: With dead ends: 361 [2019-09-03 20:08:01,029 INFO L226 Difference]: Without dead ends: 356 [2019-09-03 20:08:01,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15067, Invalid=16795, Unknown=0, NotChecked=0, Total=31862 [2019-09-03 20:08:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-03 20:08:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2019-09-03 20:08:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-03 20:08:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2019-09-03 20:08:01,033 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2019-09-03 20:08:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:08:01,033 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2019-09-03 20:08:01,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-09-03 20:08:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2019-09-03 20:08:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-03 20:08:01,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:08:01,034 INFO L399 BasicCegarLoop]: trace histogram [172, 172, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:08:01,035 INFO L418 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:08:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:08:01,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1918415753, now seen corresponding path program 172 times [2019-09-03 20:08:01,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:08:01,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:08:01,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:01,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:08:01,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:08:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:08:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 29584 backedges. 0 proven. 29584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:08:11,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:08:11,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 20:08:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST