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-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:53:35,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:53:35,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:53:35,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:53:35,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:53:35,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:53:35,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:53:35,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:53:35,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:53:35,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:53:35,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:53:35,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:53:35,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:53:35,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:53:35,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:53:35,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:53:35,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:53:35,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:53:35,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:53:35,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:53:35,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:53:35,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:53:35,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:53:35,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:53:35,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:53:35,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:53:35,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:53:35,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:53:35,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:53:35,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:53:35,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:53:35,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:53:35,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:53:35,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:53:35,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:53:35,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:53:35,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:53:35,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:53:35,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:53:35,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:53:35,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:53:35,625 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:53:35,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:53:35,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:53:35,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:53:35,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:53:35,654 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:53:35,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:53:35,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:53:35,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:53:35,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:53:35,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:53:35,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:53:35,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:53:35,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:53:35,657 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:53:35,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:53:35,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:53:35,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:53:35,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:53:35,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:53:35,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:53:35,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:53:35,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:53:35,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:53:35,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:53:35,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:53:35,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:53:35,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:53:35,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:53:35,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:53:35,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:53:35,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:53:35,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:53:35,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:53:35,724 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:53:35,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-03 19:53:35,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7fa0b9b8/108e9e1c095a437989d75b5863eb9a12/FLAGc41e7ebd8 [2019-09-03 19:53:36,197 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:53:36,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-09-03 19:53:36,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7fa0b9b8/108e9e1c095a437989d75b5863eb9a12/FLAGc41e7ebd8 [2019-09-03 19:53:36,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7fa0b9b8/108e9e1c095a437989d75b5863eb9a12 [2019-09-03 19:53:36,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:53:36,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:53:36,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:53:36,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:53:36,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:53:36,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679e3444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36, skipping insertion in model container [2019-09-03 19:53:36,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:53:36,647 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:53:36,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:53:36,810 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:53:36,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:53:36,849 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:53:36,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36 WrapperNode [2019-09-03 19:53:36,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:53:36,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:53:36,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:53:36,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:53:36,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (1/1) ... [2019-09-03 19:53:36,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:53:36,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:53:36,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:53:36,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:53:36,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (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:53:37,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:53:37,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:53:37,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:53:37,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:53:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:53:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:53:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:53:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:53:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:53:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:53:37,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:53:37,159 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:53:37,160 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:53:37,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:53:37 BoogieIcfgContainer [2019-09-03 19:53:37,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:53:37,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:53:37,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:53:37,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:53:37,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:53:36" (1/3) ... [2019-09-03 19:53:37,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e91690a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:53:37, skipping insertion in model container [2019-09-03 19:53:37,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:53:36" (2/3) ... [2019-09-03 19:53:37,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e91690a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:53:37, skipping insertion in model container [2019-09-03 19:53:37,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:53:37" (3/3) ... [2019-09-03 19:53:37,169 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-09-03 19:53:37,180 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:53:37,187 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:53:37,201 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:53:37,231 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:53:37,232 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:53:37,232 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:53:37,233 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:53:37,233 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:53:37,233 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:53:37,233 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:53:37,233 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:53:37,233 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:53:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-03 19:53:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:53:37,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:37,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:37,260 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:37,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1712329921, now seen corresponding path program 1 times [2019-09-03 19:53:37,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:37,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,371 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:53:37,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:53:37,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:53:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:53:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:53:37,395 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-09-03 19:53:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:37,416 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-09-03 19:53:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:53:37,418 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 19:53:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:37,424 INFO L225 Difference]: With dead ends: 31 [2019-09-03 19:53:37,424 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:53:37,428 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:53:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:53:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:53:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:53:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-03 19:53:37,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-03 19:53:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:37,466 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-03 19:53:37,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:53:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-03 19:53:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:53:37,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:37,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:37,467 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1703094711, now seen corresponding path program 1 times [2019-09-03 19:53:37,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:37,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,509 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:53:37,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:53:37,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:53:37,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:53:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:53:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:53:37,512 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-03 19:53:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:37,558 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-09-03 19:53:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:53:37,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:53:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:37,560 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:53:37,560 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:53:37,561 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:53:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:53:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:53:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:53:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-03 19:53:37,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-03 19:53:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:37,566 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-03 19:53:37,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:53:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-03 19:53:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:53:37,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:37,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:37,567 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1337256884, now seen corresponding path program 1 times [2019-09-03 19:53:37,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,676 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:53:37,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:37,676 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:37,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 19:53:37,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:37,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:53:37,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-03 19:53:37,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:53:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:53:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:53:37,777 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-03 19:53:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:37,831 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-09-03 19:53:37,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:53:37,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 19:53:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:37,833 INFO L225 Difference]: With dead ends: 25 [2019-09-03 19:53:37,833 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 19:53:37,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:53:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 19:53:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-03 19:53:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:53:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-03 19:53:37,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-09-03 19:53:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:37,840 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-03 19:53:37,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:53:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-03 19:53:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:53:37,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:37,842 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:37,842 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1891741908, now seen corresponding path program 1 times [2019-09-03 19:53:37,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:37,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:37,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:37,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:37,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:37,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:53:37,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:37,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:37,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-03 19:53:37,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:53:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:53:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:53:37,948 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2019-09-03 19:53:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:37,984 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-09-03 19:53:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:53:37,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 19:53:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:37,985 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:53:37,985 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:53:37,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:53:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:53:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:53:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:53:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-09-03 19:53:37,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-09-03 19:53:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:37,992 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-09-03 19:53:37,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:53:37,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-09-03 19:53:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:53:37,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:37,993 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:37,993 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash 719576937, now seen corresponding path program 2 times [2019-09-03 19:53:37,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:38,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:38,069 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:38,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:38,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:38,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:38,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:53:38,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:38,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:38,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-03 19:53:38,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:53:38,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:53:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:53:38,137 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2019-09-03 19:53:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:38,191 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-03 19:53:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:53:38,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-09-03 19:53:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:38,194 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:53:38,194 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 19:53:38,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:53:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 19:53:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 19:53:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:53:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-03 19:53:38,204 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-09-03 19:53:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:38,205 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-03 19:53:38,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:53:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-03 19:53:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:53:38,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:38,207 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:38,208 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1936086118, now seen corresponding path program 3 times [2019-09-03 19:53:38,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:38,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:38,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:38,316 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) [2019-09-03 19:53:38,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:38,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 19:53:38,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:38,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:53:38,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:53:38,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:38,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-09-03 19:53:38,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:53:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:53:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:53:38,396 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2019-09-03 19:53:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:38,453 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-09-03 19:53:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:53:38,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 19:53:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:38,456 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:53:38,457 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:53:38,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:53:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:53:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:53:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:53:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-03 19:53:38,464 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2019-09-03 19:53:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:38,464 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-03 19:53:38,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:53:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-03 19:53:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 19:53:38,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:38,465 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:38,466 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash 485983838, now seen corresponding path program 4 times [2019-09-03 19:53:38,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:38,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:38,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:38,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:38,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:38,564 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:38,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:38,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:38,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:53:38,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:38,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:38,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-03 19:53:38,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:53:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:53:38,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:53:38,626 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2019-09-03 19:53:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:38,671 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-09-03 19:53:38,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:53:38,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-09-03 19:53:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:38,673 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:53:38,673 INFO L226 Difference]: Without dead ends: 27 [2019-09-03 19:53:38,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:53:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-03 19:53:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-03 19:53:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:53:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-03 19:53:38,679 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-09-03 19:53:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:38,679 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-03 19:53:38,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:53:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-03 19:53:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:53:38,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:38,681 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:38,681 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 375097755, now seen corresponding path program 5 times [2019-09-03 19:53:38,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:38,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:38,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:38,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:38,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:38,781 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:53:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:38,815 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-03 19:53:38,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:38,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:53:38,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:38,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:38,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-03 19:53:38,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:53:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:53:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:53:38,845 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 9 states. [2019-09-03 19:53:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:38,895 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-09-03 19:53:38,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:53:38,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-03 19:53:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:38,897 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:53:38,897 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:53:38,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:53:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:53:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:53:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:53:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-03 19:53:38,910 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2019-09-03 19:53:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:38,910 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-03 19:53:38,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:53:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-03 19:53:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:53:38,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:38,912 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:38,912 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1187754392, now seen corresponding path program 6 times [2019-09-03 19:53:38,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:53:39,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:39,032 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:53:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:39,076 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-03 19:53:39,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:39,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:53:39,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:39,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:39,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-03 19:53:39,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:53:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:53:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:53:39,242 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 19 states. [2019-09-03 19:53:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:39,358 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2019-09-03 19:53:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:53:39,358 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-09-03 19:53:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:39,359 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:53:39,360 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:53:39,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:53:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:53:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-03 19:53:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:53:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-09-03 19:53:39,367 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 28 [2019-09-03 19:53:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:39,367 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-09-03 19:53:39,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:53:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2019-09-03 19:53:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-03 19:53:39,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:39,369 INFO L399 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:39,369 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:39,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1069809998, now seen corresponding path program 7 times [2019-09-03 19:53:39,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:39,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:53:39,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:39,507 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) [2019-09-03 19:53:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:39,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:53:39,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:39,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:39,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-03 19:53:39,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:53:39,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:53:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:53:39,588 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 11 states. [2019-09-03 19:53:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:39,648 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-09-03 19:53:39,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 19:53:39,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-09-03 19:53:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:39,650 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:53:39,650 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:53:39,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:53:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:53:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-03 19:53:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:53:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-09-03 19:53:39,664 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 44 [2019-09-03 19:53:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:39,665 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-09-03 19:53:39,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:53:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-09-03 19:53:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-03 19:53:39,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:39,675 INFO L399 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:39,676 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -353173137, now seen corresponding path program 8 times [2019-09-03 19:53:39,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:39,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:53:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:39,780 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:53:39,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:39,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:39,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:39,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:53:39,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-03 19:53:39,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:53:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:53:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:53:39,855 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 12 states. [2019-09-03 19:53:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:39,906 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2019-09-03 19:53:39,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:53:39,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-09-03 19:53:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:39,908 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:53:39,908 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:53:39,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:53:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:53:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-03 19:53:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:53:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-09-03 19:53:39,915 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 46 [2019-09-03 19:53:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:39,915 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-09-03 19:53:39,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:53:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-09-03 19:53:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:53:39,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:39,916 INFO L399 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:39,917 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1140082924, now seen corresponding path program 9 times [2019-09-03 19:53:39,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:39,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 187 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-03 19:53:40,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:40,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:40,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:40,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-03 19:53:40,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:40,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-03 19:53:40,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 37 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:40,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:40,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2019-09-03 19:53:40,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:53:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:53:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:53:40,514 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 32 states. [2019-09-03 19:53:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:40,719 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2019-09-03 19:53:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:53:40,719 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 48 [2019-09-03 19:53:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:40,720 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:53:40,720 INFO L226 Difference]: Without dead ends: 72 [2019-09-03 19:53:40,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:53:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-03 19:53:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-03 19:53:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:53:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-09-03 19:53:40,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 48 [2019-09-03 19:53:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:40,730 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-09-03 19:53:40,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:53:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-09-03 19:53:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 19:53:40,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:40,731 INFO L399 BasicCegarLoop]: trace histogram [30, 19, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:40,732 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2089968457, now seen corresponding path program 10 times [2019-09-03 19:53:40,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:40,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:40,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:40,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 19:53:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:40,904 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:53:40,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:40,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:40,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:53:40,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-03 19:53:40,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:53:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:53:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:53:40,985 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 14 states. [2019-09-03 19:53:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:41,019 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2019-09-03 19:53:41,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:53:41,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-09-03 19:53:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:41,020 INFO L225 Difference]: With dead ends: 117 [2019-09-03 19:53:41,020 INFO L226 Difference]: Without dead ends: 73 [2019-09-03 19:53:41,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:53:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-03 19:53:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-03 19:53:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:53:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-09-03 19:53:41,028 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 70 [2019-09-03 19:53:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:41,028 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-09-03 19:53:41,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:53:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-09-03 19:53:41,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-03 19:53:41,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:41,030 INFO L399 BasicCegarLoop]: trace histogram [31, 19, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:41,030 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 442465588, now seen corresponding path program 11 times [2019-09-03 19:53:41,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 19:53:41,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:41,169 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:53:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:41,227 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-03 19:53:41,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:41,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:53:41,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 19:53:41,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:41,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-09-03 19:53:41,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:53:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:53:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:53:41,249 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 15 states. [2019-09-03 19:53:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:41,296 INFO L93 Difference]: Finished difference Result 119 states and 158 transitions. [2019-09-03 19:53:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:53:41,297 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-09-03 19:53:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:41,298 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:53:41,299 INFO L226 Difference]: Without dead ends: 75 [2019-09-03 19:53:41,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:53:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-03 19:53:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-09-03 19:53:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-03 19:53:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2019-09-03 19:53:41,307 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 72 [2019-09-03 19:53:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:41,307 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2019-09-03 19:53:41,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:53:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2019-09-03 19:53:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-03 19:53:41,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:41,309 INFO L399 BasicCegarLoop]: trace histogram [32, 19, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:41,309 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:41,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1134873999, now seen corresponding path program 12 times [2019-09-03 19:53:41,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:41,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:41,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 518 proven. 182 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-09-03 19:53:41,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:41,450 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:53:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:41,523 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2019-09-03 19:53:41,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:41,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:53:41,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 507 proven. 361 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:42,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:42,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2019-09-03 19:53:42,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:53:42,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:53:42,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:53:42,002 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 36 states. [2019-09-03 19:53:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:42,194 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2019-09-03 19:53:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:53:42,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2019-09-03 19:53:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:42,195 INFO L225 Difference]: With dead ends: 124 [2019-09-03 19:53:42,195 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:53:42,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:53:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:53:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-09-03 19:53:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-03 19:53:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-09-03 19:53:42,203 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 74 [2019-09-03 19:53:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:42,203 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-09-03 19:53:42,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:53:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-09-03 19:53:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-03 19:53:42,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:42,205 INFO L399 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:42,205 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2056007145, now seen corresponding path program 13 times [2019-09-03 19:53:42,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:42,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:42,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:42,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:42,369 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:42,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:53:42,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:42,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:42,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-09-03 19:53:42,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 19:53:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 19:53:42,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:42,448 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 17 states. [2019-09-03 19:53:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:42,503 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2019-09-03 19:53:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:53:42,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-09-03 19:53:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:42,506 INFO L225 Difference]: With dead ends: 127 [2019-09-03 19:53:42,506 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 19:53:42,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-03 19:53:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 19:53:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-03 19:53:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-03 19:53:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2019-09-03 19:53:42,516 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 78 [2019-09-03 19:53:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:42,517 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2019-09-03 19:53:42,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 19:53:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2019-09-03 19:53:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-03 19:53:42,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:42,518 INFO L399 BasicCegarLoop]: trace histogram [35, 20, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:42,518 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash -687324826, now seen corresponding path program 14 times [2019-09-03 19:53:42,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:42,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:42,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:42,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:42,712 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) [2019-09-03 19:53:42,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:42,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:42,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:42,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 19:53:42,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:42,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:42,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-03 19:53:42,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-03 19:53:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-03 19:53:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:53:42,776 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 18 states. [2019-09-03 19:53:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:42,839 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2019-09-03 19:53:42,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-03 19:53:42,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-09-03 19:53:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:42,840 INFO L225 Difference]: With dead ends: 129 [2019-09-03 19:53:42,841 INFO L226 Difference]: Without dead ends: 83 [2019-09-03 19:53:42,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:53:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-03 19:53:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-03 19:53:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-03 19:53:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 103 transitions. [2019-09-03 19:53:42,848 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 103 transitions. Word has length 80 [2019-09-03 19:53:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:42,848 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 103 transitions. [2019-09-03 19:53:42,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-03 19:53:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2019-09-03 19:53:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-03 19:53:42,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:42,849 INFO L399 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:42,849 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:42,850 INFO L82 PathProgramCache]: Analyzing trace with hash 80570787, now seen corresponding path program 15 times [2019-09-03 19:53:42,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:42,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:42,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:42,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:43,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:43,031 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:53:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:43,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-09-03 19:53:43,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:43,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-03 19:53:43,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:43,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:43,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-09-03 19:53:43,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:53:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:53:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:53:43,122 INFO L87 Difference]: Start difference. First operand 83 states and 103 transitions. Second operand 19 states. [2019-09-03 19:53:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,190 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2019-09-03 19:53:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:53:43,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2019-09-03 19:53:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,192 INFO L225 Difference]: With dead ends: 131 [2019-09-03 19:53:43,192 INFO L226 Difference]: Without dead ends: 85 [2019-09-03 19:53:43,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:53:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-03 19:53:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-09-03 19:53:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 19:53:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2019-09-03 19:53:43,198 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 82 [2019-09-03 19:53:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,199 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2019-09-03 19:53:43,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:53:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2019-09-03 19:53:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-03 19:53:43,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,200 INFO L399 BasicCegarLoop]: trace histogram [37, 20, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,200 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash -706120032, now seen corresponding path program 16 times [2019-09-03 19:53:43,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:43,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:43,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:43,393 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:53:43,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:53:43,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:43,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:43,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:53:43,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:43,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:43,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-03 19:53:43,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-03 19:53:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-03 19:53:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:53:43,472 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand 20 states. [2019-09-03 19:53:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,531 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2019-09-03 19:53:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 19:53:43,531 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2019-09-03 19:53:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,532 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:53:43,532 INFO L226 Difference]: Without dead ends: 87 [2019-09-03 19:53:43,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:53:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-03 19:53:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-09-03 19:53:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-03 19:53:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2019-09-03 19:53:43,538 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 84 [2019-09-03 19:53:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,538 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2019-09-03 19:53:43,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-03 19:53:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2019-09-03 19:53:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:53:43,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,539 INFO L399 BasicCegarLoop]: trace histogram [38, 20, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,540 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash -801752995, now seen corresponding path program 17 times [2019-09-03 19:53:43,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:43,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:43,733 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:53:43,745 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:53:43,791 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-09-03 19:53:43,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:43,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:53:43,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:43,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:43,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-03 19:53:43,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:53:43,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:53:43,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:53:43,813 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand 21 states. [2019-09-03 19:53:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:43,901 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2019-09-03 19:53:43,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:53:43,901 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2019-09-03 19:53:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:43,902 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:53:43,903 INFO L226 Difference]: Without dead ends: 89 [2019-09-03 19:53:43,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:53:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-03 19:53:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-09-03 19:53:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-03 19:53:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2019-09-03 19:53:43,908 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 86 [2019-09-03 19:53:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:43,909 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2019-09-03 19:53:43,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:53:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2019-09-03 19:53:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:53:43,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:43,910 INFO L399 BasicCegarLoop]: trace histogram [39, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:43,910 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1784250074, now seen corresponding path program 18 times [2019-09-03 19:53:43,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:43,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:43,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-03 19:53:44,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:44,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 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:53:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:44,209 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2019-09-03 19:53:44,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:44,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:53:44,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 779 proven. 400 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-03 19:53:44,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:44,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-03 19:53:44,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:53:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:53:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:53:44,849 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand 43 states. [2019-09-03 19:53:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,080 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2019-09-03 19:53:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:53:45,080 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 88 [2019-09-03 19:53:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,081 INFO L225 Difference]: With dead ends: 140 [2019-09-03 19:53:45,081 INFO L226 Difference]: Without dead ends: 94 [2019-09-03 19:53:45,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:53:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-03 19:53:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-09-03 19:53:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:53:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2019-09-03 19:53:45,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 88 [2019-09-03 19:53:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,086 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2019-09-03 19:53:45,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:53:45,087 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2019-09-03 19:53:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 19:53:45,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,088 INFO L399 BasicCegarLoop]: trace histogram [41, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,088 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash 765850962, now seen corresponding path program 19 times [2019-09-03 19:53:45,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 19:53:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,346 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:53:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 19:53:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-09-03 19:53:45,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:53:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:53:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:53:45,434 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 23 states. [2019-09-03 19:53:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,511 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2019-09-03 19:53:45,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-03 19:53:45,514 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 92 [2019-09-03 19:53:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,515 INFO L225 Difference]: With dead ends: 143 [2019-09-03 19:53:45,515 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 19:53:45,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:53:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 19:53:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-03 19:53:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:53:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2019-09-03 19:53:45,520 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 92 [2019-09-03 19:53:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,520 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2019-09-03 19:53:45,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:53:45,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2019-09-03 19:53:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-03 19:53:45,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,522 INFO L399 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,522 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,522 INFO L82 PathProgramCache]: Analyzing trace with hash 707242511, now seen corresponding path program 20 times [2019-09-03 19:53:45,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:45,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 19:53:45,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:45,791 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:53:45,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:45,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:45,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:45,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-03 19:53:45,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 19:53:45,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:45,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-03 19:53:45,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-03 19:53:45,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-03 19:53:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:53:45,883 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 24 states. [2019-09-03 19:53:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:45,961 INFO L93 Difference]: Finished difference Result 145 states and 188 transitions. [2019-09-03 19:53:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:53:45,962 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 94 [2019-09-03 19:53:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:45,963 INFO L225 Difference]: With dead ends: 145 [2019-09-03 19:53:45,964 INFO L226 Difference]: Without dead ends: 97 [2019-09-03 19:53:45,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-03 19:53:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-03 19:53:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-03 19:53:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-03 19:53:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2019-09-03 19:53:45,970 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 94 [2019-09-03 19:53:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:45,971 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2019-09-03 19:53:45,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-03 19:53:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2019-09-03 19:53:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-03 19:53:45,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:45,973 INFO L399 BasicCegarLoop]: trace histogram [43, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:45,973 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash 219095948, now seen corresponding path program 21 times [2019-09-03 19:53:45,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:45,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:45,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:45,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 943 proven. 506 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-09-03 19:53:46,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:46,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:53:46,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:46,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-09-03 19:53:46,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:46,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 19:53:46,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 85 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:53:47,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:47,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 45] total 68 [2019-09-03 19:53:47,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-03 19:53:47,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-03 19:53:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:53:47,832 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 68 states. [2019-09-03 19:53:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:48,350 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2019-09-03 19:53:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-03 19:53:48,351 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 96 [2019-09-03 19:53:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:48,352 INFO L225 Difference]: With dead ends: 192 [2019-09-03 19:53:48,352 INFO L226 Difference]: Without dead ends: 144 [2019-09-03 19:53:48,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-03 19:53:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-03 19:53:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-03 19:53:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-03 19:53:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2019-09-03 19:53:48,360 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 96 [2019-09-03 19:53:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:48,360 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2019-09-03 19:53:48,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-03 19:53:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2019-09-03 19:53:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-03 19:53:48,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:48,362 INFO L399 BasicCegarLoop]: trace histogram [66, 43, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:48,363 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash -906433893, now seen corresponding path program 22 times [2019-09-03 19:53:48,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:48,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:48,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:48,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 19:53:48,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:48,689 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) [2019-09-03 19:53:48,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:48,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:48,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:48,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:53:48,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 19:53:48,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:48,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-03 19:53:48,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:53:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:53:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:53:48,817 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand 26 states. [2019-09-03 19:53:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:48,935 INFO L93 Difference]: Finished difference Result 237 states and 324 transitions. [2019-09-03 19:53:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:53:48,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 142 [2019-09-03 19:53:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:48,938 INFO L225 Difference]: With dead ends: 237 [2019-09-03 19:53:48,938 INFO L226 Difference]: Without dead ends: 145 [2019-09-03 19:53:48,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:53:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-03 19:53:48,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-09-03 19:53:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-03 19:53:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2019-09-03 19:53:48,945 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 142 [2019-09-03 19:53:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:48,945 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2019-09-03 19:53:48,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:53:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2019-09-03 19:53:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-03 19:53:48,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:48,946 INFO L399 BasicCegarLoop]: trace histogram [67, 43, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:48,947 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1926927896, now seen corresponding path program 23 times [2019-09-03 19:53:48,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:48,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:48,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 19:53:49,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,364 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:53:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:49,493 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2019-09-03 19:53:49,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:49,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 19:53:49,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:53:49,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:49,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-09-03 19:53:49,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:53:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:53:49,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:53:49,525 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand 27 states. [2019-09-03 19:53:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:49,619 INFO L93 Difference]: Finished difference Result 239 states and 326 transitions. [2019-09-03 19:53:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-03 19:53:49,620 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 144 [2019-09-03 19:53:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:49,621 INFO L225 Difference]: With dead ends: 239 [2019-09-03 19:53:49,621 INFO L226 Difference]: Without dead ends: 147 [2019-09-03 19:53:49,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:53:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-03 19:53:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-09-03 19:53:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-03 19:53:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2019-09-03 19:53:49,628 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 144 [2019-09-03 19:53:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:49,628 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2019-09-03 19:53:49,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:53:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2019-09-03 19:53:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-03 19:53:49,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:49,629 INFO L399 BasicCegarLoop]: trace histogram [68, 43, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:49,629 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1778341461, now seen corresponding path program 24 times [2019-09-03 19:53:49,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:49,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2210 proven. 650 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-03 19:53:49,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:49,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:49,981 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:53:50,065 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2019-09-03 19:53:50,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:50,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:53:50,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2175 proven. 1849 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-03 19:53:51,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:51,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 46] total 72 [2019-09-03 19:53:51,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-03 19:53:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-03 19:53:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:53:51,588 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand 72 states. [2019-09-03 19:53:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:52,105 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2019-09-03 19:53:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-03 19:53:52,105 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 146 [2019-09-03 19:53:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:52,107 INFO L225 Difference]: With dead ends: 244 [2019-09-03 19:53:52,107 INFO L226 Difference]: Without dead ends: 152 [2019-09-03 19:53:52,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-09-03 19:53:52,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-03 19:53:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-09-03 19:53:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-03 19:53:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2019-09-03 19:53:52,114 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 146 [2019-09-03 19:53:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:52,114 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2019-09-03 19:53:52,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-03 19:53:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2019-09-03 19:53:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-03 19:53:52,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:52,116 INFO L399 BasicCegarLoop]: trace histogram [70, 44, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:52,116 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:52,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:52,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2090699827, now seen corresponding path program 25 times [2019-09-03 19:53:52,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:52,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:52,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:52,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:52,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:52,454 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:53:52,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:52,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 19:53:52,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:52,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:52,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-09-03 19:53:52,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:53:52,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:53:52,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:53:52,549 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 29 states. [2019-09-03 19:53:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:52,632 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2019-09-03 19:53:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-03 19:53:52,633 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 150 [2019-09-03 19:53:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:52,634 INFO L225 Difference]: With dead ends: 247 [2019-09-03 19:53:52,634 INFO L226 Difference]: Without dead ends: 153 [2019-09-03 19:53:52,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:53:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-03 19:53:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-09-03 19:53:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-03 19:53:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2019-09-03 19:53:52,640 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 150 [2019-09-03 19:53:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:52,640 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2019-09-03 19:53:52,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:53:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2019-09-03 19:53:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-03 19:53:52,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:52,642 INFO L399 BasicCegarLoop]: trace histogram [71, 44, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:52,642 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash -690793910, now seen corresponding path program 26 times [2019-09-03 19:53:52,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:52,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:52,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:53,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:53,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:53,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:53,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:53,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-03 19:53:53,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:53,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-03 19:53:53,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 19:53:53,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 19:53:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:53:53,144 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand 30 states. [2019-09-03 19:53:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:53,320 INFO L93 Difference]: Finished difference Result 249 states and 338 transitions. [2019-09-03 19:53:53,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-03 19:53:53,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 152 [2019-09-03 19:53:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:53,322 INFO L225 Difference]: With dead ends: 249 [2019-09-03 19:53:53,322 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:53:53,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-03 19:53:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:53:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-09-03 19:53:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-03 19:53:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 199 transitions. [2019-09-03 19:53:53,331 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 199 transitions. Word has length 152 [2019-09-03 19:53:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:53,332 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 199 transitions. [2019-09-03 19:53:53,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 19:53:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 199 transitions. [2019-09-03 19:53:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-03 19:53:53,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:53,333 INFO L399 BasicCegarLoop]: trace histogram [72, 44, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:53,333 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 294028679, now seen corresponding path program 27 times [2019-09-03 19:53:53,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:53,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:53,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:53,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:53,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:53,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:53,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:53:53,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-03 19:53:53,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:53,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:53:53,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:53,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:53,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-09-03 19:53:53,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 19:53:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 19:53:53,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:53:53,847 INFO L87 Difference]: Start difference. First operand 155 states and 199 transitions. Second operand 31 states. [2019-09-03 19:53:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:53,992 INFO L93 Difference]: Finished difference Result 251 states and 340 transitions. [2019-09-03 19:53:53,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-03 19:53:53,992 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 154 [2019-09-03 19:53:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:53,993 INFO L225 Difference]: With dead ends: 251 [2019-09-03 19:53:53,993 INFO L226 Difference]: Without dead ends: 157 [2019-09-03 19:53:53,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:53:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-03 19:53:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-09-03 19:53:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-03 19:53:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 201 transitions. [2019-09-03 19:53:54,002 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 201 transitions. Word has length 154 [2019-09-03 19:53:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:54,002 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 201 transitions. [2019-09-03 19:53:54,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 19:53:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2019-09-03 19:53:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-03 19:53:54,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:54,004 INFO L399 BasicCegarLoop]: trace histogram [73, 44, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:54,004 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1815731588, now seen corresponding path program 28 times [2019-09-03 19:53:54,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:54,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:54,411 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) [2019-09-03 19:53:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:54,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:53:54,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:54,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-03 19:53:54,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:54,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-09-03 19:53:54,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-03 19:53:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-03 19:53:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:53:54,508 INFO L87 Difference]: Start difference. First operand 157 states and 201 transitions. Second operand 32 states. [2019-09-03 19:53:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:54,613 INFO L93 Difference]: Finished difference Result 253 states and 342 transitions. [2019-09-03 19:53:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:53:54,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 156 [2019-09-03 19:53:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:54,615 INFO L225 Difference]: With dead ends: 253 [2019-09-03 19:53:54,615 INFO L226 Difference]: Without dead ends: 159 [2019-09-03 19:53:54,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:53:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-03 19:53:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-09-03 19:53:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-03 19:53:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 203 transitions. [2019-09-03 19:53:54,622 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 203 transitions. Word has length 156 [2019-09-03 19:53:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:54,622 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 203 transitions. [2019-09-03 19:53:54,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-03 19:53:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 203 transitions. [2019-09-03 19:53:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-03 19:53:54,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:54,623 INFO L399 BasicCegarLoop]: trace histogram [74, 44, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:54,623 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -411620799, now seen corresponding path program 29 times [2019-09-03 19:53:54,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:54,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:54,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:55,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:55,206 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) [2019-09-03 19:53:55,239 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:55,350 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 75 check-sat command(s) [2019-09-03 19:53:55,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:55,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 19:53:55,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:55,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:55,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-09-03 19:53:55,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-03 19:53:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-03 19:53:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:53:55,375 INFO L87 Difference]: Start difference. First operand 159 states and 203 transitions. Second operand 33 states. [2019-09-03 19:53:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:55,503 INFO L93 Difference]: Finished difference Result 255 states and 344 transitions. [2019-09-03 19:53:55,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-03 19:53:55,503 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 158 [2019-09-03 19:53:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:55,505 INFO L225 Difference]: With dead ends: 255 [2019-09-03 19:53:55,505 INFO L226 Difference]: Without dead ends: 161 [2019-09-03 19:53:55,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-03 19:53:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-03 19:53:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-09-03 19:53:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-03 19:53:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 205 transitions. [2019-09-03 19:53:55,512 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 205 transitions. Word has length 158 [2019-09-03 19:53:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:55,513 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 205 transitions. [2019-09-03 19:53:55,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-03 19:53:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 205 transitions. [2019-09-03 19:53:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-03 19:53:55,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:55,514 INFO L399 BasicCegarLoop]: trace histogram [75, 44, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:55,514 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2003551298, now seen corresponding path program 30 times [2019-09-03 19:53:55,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:55,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:55,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:55,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2784 proven. 992 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-03 19:53:55,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:55,980 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) [2019-09-03 19:53:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:53:56,114 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2019-09-03 19:53:56,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:56,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:53:56,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2759 proven. 1936 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-09-03 19:53:57,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:57,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 47] total 79 [2019-09-03 19:53:57,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-03 19:53:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-03 19:53:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:53:57,829 INFO L87 Difference]: Start difference. First operand 161 states and 205 transitions. Second operand 79 states. [2019-09-03 19:53:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:58,454 INFO L93 Difference]: Finished difference Result 260 states and 352 transitions. [2019-09-03 19:53:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-03 19:53:58,455 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 160 [2019-09-03 19:53:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:58,456 INFO L225 Difference]: With dead ends: 260 [2019-09-03 19:53:58,456 INFO L226 Difference]: Without dead ends: 166 [2019-09-03 19:53:58,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-09-03 19:53:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-03 19:53:58,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-09-03 19:53:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-03 19:53:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2019-09-03 19:53:58,463 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 160 [2019-09-03 19:53:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:58,463 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2019-09-03 19:53:58,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-03 19:53:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2019-09-03 19:53:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-03 19:53:58,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:58,465 INFO L399 BasicCegarLoop]: trace histogram [77, 45, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:58,465 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1220455370, now seen corresponding path program 31 times [2019-09-03 19:53:58,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:58,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:53:58,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:58,928 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:53:58,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:58,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-03 19:53:58,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:53:59,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:59,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-09-03 19:53:59,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-03 19:53:59,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-03 19:53:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:53:59,024 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 35 states. [2019-09-03 19:53:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:59,123 INFO L93 Difference]: Finished difference Result 263 states and 354 transitions. [2019-09-03 19:53:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-03 19:53:59,123 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 164 [2019-09-03 19:53:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:59,124 INFO L225 Difference]: With dead ends: 263 [2019-09-03 19:53:59,124 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 19:53:59,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-03 19:53:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 19:53:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-09-03 19:53:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-03 19:53:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 212 transitions. [2019-09-03 19:53:59,130 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 212 transitions. Word has length 164 [2019-09-03 19:53:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:59,130 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 212 transitions. [2019-09-03 19:53:59,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-03 19:53:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 212 transitions. [2019-09-03 19:53:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-03 19:53:59,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:59,131 INFO L399 BasicCegarLoop]: trace histogram [78, 45, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:59,132 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1828230131, now seen corresponding path program 32 times [2019-09-03 19:53:59,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:59,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:53:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:53:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:53:59,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:53:59,731 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:53:59,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:53:59,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:53:59,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:53:59,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-03 19:53:59,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:53:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:53:59,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:53:59,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-03 19:53:59,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-03 19:53:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-03 19:53:59,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:53:59,828 INFO L87 Difference]: Start difference. First operand 167 states and 212 transitions. Second operand 36 states. [2019-09-03 19:53:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:53:59,954 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2019-09-03 19:53:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-03 19:53:59,955 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 166 [2019-09-03 19:53:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:53:59,956 INFO L225 Difference]: With dead ends: 265 [2019-09-03 19:53:59,956 INFO L226 Difference]: Without dead ends: 169 [2019-09-03 19:53:59,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:53:59,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-03 19:53:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-09-03 19:53:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-03 19:53:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 214 transitions. [2019-09-03 19:53:59,961 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 214 transitions. Word has length 166 [2019-09-03 19:53:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:53:59,961 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 214 transitions. [2019-09-03 19:53:59,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-03 19:53:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 214 transitions. [2019-09-03 19:53:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-03 19:53:59,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:53:59,963 INFO L399 BasicCegarLoop]: trace histogram [79, 45, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:53:59,963 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:53:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:53:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1847666576, now seen corresponding path program 33 times [2019-09-03 19:53:59,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:53:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:53:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:53:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:53:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:00,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:00,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:00,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2019-09-03 19:54:00,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:00,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 19:54:00,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:00,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:00,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-09-03 19:54:00,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-03 19:54:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-03 19:54:00,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:54:00,670 INFO L87 Difference]: Start difference. First operand 169 states and 214 transitions. Second operand 37 states. [2019-09-03 19:54:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:00,781 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2019-09-03 19:54:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-03 19:54:00,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 168 [2019-09-03 19:54:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:00,782 INFO L225 Difference]: With dead ends: 267 [2019-09-03 19:54:00,782 INFO L226 Difference]: Without dead ends: 171 [2019-09-03 19:54:00,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-03 19:54:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-03 19:54:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-09-03 19:54:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-03 19:54:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 216 transitions. [2019-09-03 19:54:00,789 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 216 transitions. Word has length 168 [2019-09-03 19:54:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:00,789 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 216 transitions. [2019-09-03 19:54:00,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-03 19:54:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 216 transitions. [2019-09-03 19:54:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 19:54:00,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:00,791 INFO L399 BasicCegarLoop]: trace histogram [80, 45, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:00,791 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:00,791 INFO L82 PathProgramCache]: Analyzing trace with hash 373682605, now seen corresponding path program 34 times [2019-09-03 19:54:00,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:00,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:01,484 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) [2019-09-03 19:54:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:01,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:01,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:01,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-03 19:54:01,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:01,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:01,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-03 19:54:01,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-03 19:54:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-03 19:54:01,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:54:01,589 INFO L87 Difference]: Start difference. First operand 171 states and 216 transitions. Second operand 38 states. [2019-09-03 19:54:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:01,712 INFO L93 Difference]: Finished difference Result 269 states and 360 transitions. [2019-09-03 19:54:01,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-03 19:54:01,712 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 170 [2019-09-03 19:54:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:01,714 INFO L225 Difference]: With dead ends: 269 [2019-09-03 19:54:01,714 INFO L226 Difference]: Without dead ends: 173 [2019-09-03 19:54:01,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-03 19:54:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-03 19:54:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-09-03 19:54:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-03 19:54:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 218 transitions. [2019-09-03 19:54:01,719 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 218 transitions. Word has length 170 [2019-09-03 19:54:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:01,719 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 218 transitions. [2019-09-03 19:54:01,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-03 19:54:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 218 transitions. [2019-09-03 19:54:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-03 19:54:01,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:01,721 INFO L399 BasicCegarLoop]: trace histogram [81, 45, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:01,721 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash 491499434, now seen corresponding path program 35 times [2019-09-03 19:54:01,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:01,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:01,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:02,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:02,365 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:54:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:02,478 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2019-09-03 19:54:02,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:02,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 19:54:02,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:02,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:02,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-03 19:54:02,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-03 19:54:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-03 19:54:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:54:02,539 INFO L87 Difference]: Start difference. First operand 173 states and 218 transitions. Second operand 39 states. [2019-09-03 19:54:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:02,664 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2019-09-03 19:54:02,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-03 19:54:02,664 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 172 [2019-09-03 19:54:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:02,666 INFO L225 Difference]: With dead ends: 271 [2019-09-03 19:54:02,666 INFO L226 Difference]: Without dead ends: 175 [2019-09-03 19:54:02,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-03 19:54:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-03 19:54:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-09-03 19:54:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 19:54:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 220 transitions. [2019-09-03 19:54:02,671 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 220 transitions. Word has length 172 [2019-09-03 19:54:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:02,671 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 220 transitions. [2019-09-03 19:54:02,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-03 19:54:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 220 transitions. [2019-09-03 19:54:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-03 19:54:02,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:02,673 INFO L399 BasicCegarLoop]: trace histogram [82, 45, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:02,673 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2044322407, now seen corresponding path program 36 times [2019-09-03 19:54:02,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:02,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:02,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:03,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:03,699 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) [2019-09-03 19:54:03,714 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:03,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2019-09-03 19:54:03,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:03,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-03 19:54:03,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:03,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-09-03 19:54:03,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-03 19:54:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-03 19:54:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:54:03,892 INFO L87 Difference]: Start difference. First operand 175 states and 220 transitions. Second operand 40 states. [2019-09-03 19:54:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:04,024 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2019-09-03 19:54:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-03 19:54:04,024 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 174 [2019-09-03 19:54:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:04,026 INFO L225 Difference]: With dead ends: 273 [2019-09-03 19:54:04,026 INFO L226 Difference]: Without dead ends: 177 [2019-09-03 19:54:04,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-03 19:54:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-03 19:54:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-09-03 19:54:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-03 19:54:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2019-09-03 19:54:04,032 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 174 [2019-09-03 19:54:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:04,032 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2019-09-03 19:54:04,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-03 19:54:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2019-09-03 19:54:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-03 19:54:04,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:04,033 INFO L399 BasicCegarLoop]: trace histogram [83, 45, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:04,034 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:04,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash -341419548, now seen corresponding path program 37 times [2019-09-03 19:54:04,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:04,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:04,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:04,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:04,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:04,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:04,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:04,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 19:54:04,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:04,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:04,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-09-03 19:54:04,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:54:04,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:54:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:54:04,749 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand 41 states. [2019-09-03 19:54:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:04,869 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2019-09-03 19:54:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-03 19:54:04,869 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 176 [2019-09-03 19:54:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:04,871 INFO L225 Difference]: With dead ends: 275 [2019-09-03 19:54:04,871 INFO L226 Difference]: Without dead ends: 179 [2019-09-03 19:54:04,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:54:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-03 19:54:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-09-03 19:54:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-03 19:54:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 224 transitions. [2019-09-03 19:54:04,877 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 224 transitions. Word has length 176 [2019-09-03 19:54:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:04,878 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 224 transitions. [2019-09-03 19:54:04,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:54:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 224 transitions. [2019-09-03 19:54:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-03 19:54:04,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:04,879 INFO L399 BasicCegarLoop]: trace histogram [84, 45, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:04,879 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:04,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:04,879 INFO L82 PathProgramCache]: Analyzing trace with hash 473097761, now seen corresponding path program 38 times [2019-09-03 19:54:04,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:04,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:04,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:05,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:05,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:05,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:05,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:05,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:05,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-03 19:54:05,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:05,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:05,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-03 19:54:05,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-03 19:54:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-03 19:54:05,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:54:05,629 INFO L87 Difference]: Start difference. First operand 179 states and 224 transitions. Second operand 42 states. [2019-09-03 19:54:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:05,797 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2019-09-03 19:54:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-03 19:54:05,798 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 178 [2019-09-03 19:54:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:05,799 INFO L225 Difference]: With dead ends: 277 [2019-09-03 19:54:05,800 INFO L226 Difference]: Without dead ends: 181 [2019-09-03 19:54:05,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-03 19:54:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-03 19:54:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-03 19:54:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-03 19:54:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2019-09-03 19:54:05,806 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 178 [2019-09-03 19:54:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:05,807 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2019-09-03 19:54:05,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-03 19:54:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2019-09-03 19:54:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-03 19:54:05,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:05,808 INFO L399 BasicCegarLoop]: trace histogram [85, 45, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:05,808 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:05,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1540183838, now seen corresponding path program 39 times [2019-09-03 19:54:05,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:05,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:05,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:06,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:06,602 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:54:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:06,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2019-09-03 19:54:06,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:06,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-03 19:54:06,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:06,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:06,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-09-03 19:54:06,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-03 19:54:06,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-03 19:54:06,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:54:06,821 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand 43 states. [2019-09-03 19:54:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:06,949 INFO L93 Difference]: Finished difference Result 279 states and 370 transitions. [2019-09-03 19:54:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-03 19:54:06,949 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 180 [2019-09-03 19:54:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:06,951 INFO L225 Difference]: With dead ends: 279 [2019-09-03 19:54:06,951 INFO L226 Difference]: Without dead ends: 183 [2019-09-03 19:54:06,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-03 19:54:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-03 19:54:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-09-03 19:54:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-03 19:54:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 228 transitions. [2019-09-03 19:54:06,956 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 228 transitions. Word has length 180 [2019-09-03 19:54:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:06,957 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 228 transitions. [2019-09-03 19:54:06,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-03 19:54:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 228 transitions. [2019-09-03 19:54:06,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-03 19:54:06,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:06,958 INFO L399 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:06,959 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash 512720091, now seen corresponding path program 40 times [2019-09-03 19:54:06,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:06,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:06,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:07,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:07,862 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:54:07,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:07,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:07,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:07,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-03 19:54:07,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:07,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:07,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-03 19:54:07,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-03 19:54:07,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-03 19:54:07,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:54:07,973 INFO L87 Difference]: Start difference. First operand 183 states and 228 transitions. Second operand 44 states. [2019-09-03 19:54:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:08,084 INFO L93 Difference]: Finished difference Result 281 states and 372 transitions. [2019-09-03 19:54:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-03 19:54:08,085 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 182 [2019-09-03 19:54:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:08,086 INFO L225 Difference]: With dead ends: 281 [2019-09-03 19:54:08,086 INFO L226 Difference]: Without dead ends: 185 [2019-09-03 19:54:08,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-03 19:54:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-03 19:54:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-09-03 19:54:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 19:54:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 230 transitions. [2019-09-03 19:54:08,092 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 230 transitions. Word has length 182 [2019-09-03 19:54:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:08,092 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 230 transitions. [2019-09-03 19:54:08,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-03 19:54:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 230 transitions. [2019-09-03 19:54:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-03 19:54:08,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:08,094 INFO L399 BasicCegarLoop]: trace histogram [87, 45, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:08,094 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:08,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:08,094 INFO L82 PathProgramCache]: Analyzing trace with hash 962537304, now seen corresponding path program 41 times [2019-09-03 19:54:08,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:08,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:08,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:08,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:08,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:09,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:09,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 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:54:09,169 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:09,309 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2019-09-03 19:54:09,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:09,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-03 19:54:09,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:09,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:09,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-09-03 19:54:09,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-03 19:54:09,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-03 19:54:09,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:54:09,375 INFO L87 Difference]: Start difference. First operand 185 states and 230 transitions. Second operand 45 states. [2019-09-03 19:54:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:09,506 INFO L93 Difference]: Finished difference Result 283 states and 374 transitions. [2019-09-03 19:54:09,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-03 19:54:09,506 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2019-09-03 19:54:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:09,507 INFO L225 Difference]: With dead ends: 283 [2019-09-03 19:54:09,507 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 19:54:09,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-03 19:54:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 19:54:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-09-03 19:54:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-03 19:54:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 232 transitions. [2019-09-03 19:54:09,514 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 232 transitions. Word has length 184 [2019-09-03 19:54:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:09,514 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 232 transitions. [2019-09-03 19:54:09,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-03 19:54:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2019-09-03 19:54:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-03 19:54:09,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:09,515 INFO L399 BasicCegarLoop]: trace histogram [88, 45, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:09,516 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash -554817899, now seen corresponding path program 42 times [2019-09-03 19:54:09,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:09,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:09,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:09,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:09,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 1892 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-03 19:54:10,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:10,291 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:54:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:10,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 88 check-sat command(s) [2019-09-03 19:54:10,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:10,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-03 19:54:10,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3913 proven. 2025 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2019-09-03 19:54:12,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:12,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 48] total 92 [2019-09-03 19:54:12,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-03 19:54:12,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-03 19:54:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:54:12,527 INFO L87 Difference]: Start difference. First operand 187 states and 232 transitions. Second operand 92 states. [2019-09-03 19:54:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:13,348 INFO L93 Difference]: Finished difference Result 288 states and 382 transitions. [2019-09-03 19:54:13,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-03 19:54:13,349 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 186 [2019-09-03 19:54:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:13,350 INFO L225 Difference]: With dead ends: 288 [2019-09-03 19:54:13,351 INFO L226 Difference]: Without dead ends: 192 [2019-09-03 19:54:13,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-09-03 19:54:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-03 19:54:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-09-03 19:54:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-03 19:54:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2019-09-03 19:54:13,361 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 186 [2019-09-03 19:54:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:13,361 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2019-09-03 19:54:13,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-03 19:54:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2019-09-03 19:54:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-03 19:54:13,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:13,363 INFO L399 BasicCegarLoop]: trace histogram [90, 46, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:13,364 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:13,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1494283021, now seen corresponding path program 43 times [2019-09-03 19:54:13,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:13,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:13,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:13,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:13,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 19:54:14,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:14,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:54:14,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:14,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:54:14,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 19:54:14,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:14,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-09-03 19:54:14,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-03 19:54:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-03 19:54:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:54:14,892 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand 47 states. [2019-09-03 19:54:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:15,043 INFO L93 Difference]: Finished difference Result 291 states and 384 transitions. [2019-09-03 19:54:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-03 19:54:15,043 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 190 [2019-09-03 19:54:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:15,044 INFO L225 Difference]: With dead ends: 291 [2019-09-03 19:54:15,044 INFO L226 Difference]: Without dead ends: 193 [2019-09-03 19:54:15,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-03 19:54:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-03 19:54:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-09-03 19:54:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 19:54:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 239 transitions. [2019-09-03 19:54:15,050 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 239 transitions. Word has length 190 [2019-09-03 19:54:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:15,051 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 239 transitions. [2019-09-03 19:54:15,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-03 19:54:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2019-09-03 19:54:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-03 19:54:15,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:15,052 INFO L399 BasicCegarLoop]: trace histogram [91, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:15,052 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash 201379978, now seen corresponding path program 44 times [2019-09-03 19:54:15,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:15,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:15,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:15,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 19:54:15,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:15,980 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:54:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:54:16,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:54:16,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:16,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 19:54:16,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 19:54:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:16,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-09-03 19:54:16,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-03 19:54:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-03 19:54:16,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:54:16,083 INFO L87 Difference]: Start difference. First operand 193 states and 239 transitions. Second operand 48 states. [2019-09-03 19:54:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:16,220 INFO L93 Difference]: Finished difference Result 293 states and 386 transitions. [2019-09-03 19:54:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-03 19:54:16,225 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 192 [2019-09-03 19:54:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:16,227 INFO L225 Difference]: With dead ends: 293 [2019-09-03 19:54:16,227 INFO L226 Difference]: Without dead ends: 195 [2019-09-03 19:54:16,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:54:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-03 19:54:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-09-03 19:54:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-03 19:54:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 241 transitions. [2019-09-03 19:54:16,233 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 241 transitions. Word has length 192 [2019-09-03 19:54:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:16,233 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 241 transitions. [2019-09-03 19:54:16,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-03 19:54:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 241 transitions. [2019-09-03 19:54:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-03 19:54:16,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:16,235 INFO L399 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:16,235 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1032895801, now seen corresponding path program 45 times [2019-09-03 19:54:16,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4277 proven. 2162 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2019-09-03 19:54:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:17,082 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:54:17,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:54:17,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-09-03 19:54:17,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:17,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 94 conjunts are in the unsatisfiable core [2019-09-03 19:54:17,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:19,467 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:54:19,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:19,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 95] total 95 [2019-09-03 19:54:19,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-03 19:54:19,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-03 19:54:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:54:19,472 INFO L87 Difference]: Start difference. First operand 195 states and 241 transitions. Second operand 95 states. [2019-09-03 19:54:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:20,235 INFO L93 Difference]: Finished difference Result 301 states and 397 transitions. [2019-09-03 19:54:20,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-03 19:54:20,235 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2019-09-03 19:54:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:20,238 INFO L225 Difference]: With dead ends: 301 [2019-09-03 19:54:20,238 INFO L226 Difference]: Without dead ends: 203 [2019-09-03 19:54:20,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-09-03 19:54:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-03 19:54:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-09-03 19:54:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-03 19:54:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2019-09-03 19:54:20,244 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 194 [2019-09-03 19:54:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:20,245 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2019-09-03 19:54:20,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-03 19:54:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2019-09-03 19:54:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-03 19:54:20,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:20,246 INFO L399 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:20,247 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1281156293, now seen corresponding path program 46 times [2019-09-03 19:54:20,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:20,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:23,543 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:54:23,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:23,544 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:54:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 19:54:23,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:54:23,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:23,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 98 conjunts are in the unsatisfiable core [2019-09-03 19:54:23,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 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): Stream closed [2019-09-03 19:54:23,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:23,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-09-03 19:54:23,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-09-03 19:54:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-09-03 19:54:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:54:23,677 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand 99 states. [2019-09-03 19:54:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:24,450 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2019-09-03 19:54:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-03 19:54:24,450 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2019-09-03 19:54:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:24,453 INFO L225 Difference]: With dead ends: 211 [2019-09-03 19:54:24,453 INFO L226 Difference]: Without dead ends: 206 [2019-09-03 19:54:24,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-09-03 19:54:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-03 19:54:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-03 19:54:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-03 19:54:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 252 transitions. [2019-09-03 19:54:24,460 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 252 transitions. Word has length 202 [2019-09-03 19:54:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:24,461 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 252 transitions. [2019-09-03 19:54:24,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-09-03 19:54:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 252 transitions. [2019-09-03 19:54:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-03 19:54:24,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:24,462 INFO L399 BasicCegarLoop]: trace histogram [97, 50, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:24,462 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1727513226, now seen corresponding path program 47 times [2019-09-03 19:54:24,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:24,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:27,891 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:54:27,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:27,891 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:54:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:54:28,037 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 98 check-sat command(s) [2019-09-03 19:54:28,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:28,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-03 19:54:28,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 2304 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-09-03 19:54:28,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:28,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 51] total 101 [2019-09-03 19:54:28,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-09-03 19:54:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-09-03 19:54:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:54:28,201 INFO L87 Difference]: Start difference. First operand 205 states and 252 transitions. Second operand 101 states. [2019-09-03 19:54:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:29,245 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2019-09-03 19:54:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-03 19:54:29,245 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 204 [2019-09-03 19:54:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:29,248 INFO L225 Difference]: With dead ends: 215 [2019-09-03 19:54:29,248 INFO L226 Difference]: Without dead ends: 210 [2019-09-03 19:54:29,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-09-03 19:54:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-03 19:54:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-09-03 19:54:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-03 19:54:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 258 transitions. [2019-09-03 19:54:29,254 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 258 transitions. Word has length 204 [2019-09-03 19:54:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:29,254 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 258 transitions. [2019-09-03 19:54:29,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-09-03 19:54:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 258 transitions. [2019-09-03 19:54:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-03 19:54:29,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:29,256 INFO L399 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:29,256 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:29,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1190218156, now seen corresponding path program 48 times [2019-09-03 19:54:29,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:29,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:29,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:29,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:29,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:32,681 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:54:32,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:32,682 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:54:32,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:54:32,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 99 check-sat command(s) [2019-09-03 19:54:32,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:54:32,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-03 19:54:32,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:54:32,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:32,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 52] total 102 [2019-09-03 19:54:32,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-03 19:54:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-03 19:54:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:54:32,872 INFO L87 Difference]: Start difference. First operand 209 states and 258 transitions. Second operand 102 states. [2019-09-03 19:54:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:33,654 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2019-09-03 19:54:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-03 19:54:33,654 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2019-09-03 19:54:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:33,657 INFO L225 Difference]: With dead ends: 216 [2019-09-03 19:54:33,657 INFO L226 Difference]: Without dead ends: 211 [2019-09-03 19:54:33,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-03 19:54:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-03 19:54:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-03 19:54:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-03 19:54:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 261 transitions. [2019-09-03 19:54:33,664 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 261 transitions. Word has length 208 [2019-09-03 19:54:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:33,664 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 261 transitions. [2019-09-03 19:54:33,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-03 19:54:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 261 transitions. [2019-09-03 19:54:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-03 19:54:33,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:33,666 INFO L399 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:33,666 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1853582425, now seen corresponding path program 49 times [2019-09-03 19:54:33,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:33,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:54:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 19:54:35,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:54:35,396 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:54:35,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:35,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 108 conjunts are in the unsatisfiable core [2019-09-03 19:54:35,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:54:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:54:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 19:54:35,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:54:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-09-03 19:54:35,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-03 19:54:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-03 19:54:35,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-09-03 19:54:35,808 INFO L87 Difference]: Start difference. First operand 211 states and 261 transitions. Second operand 57 states. [2019-09-03 19:54:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:37,632 INFO L93 Difference]: Finished difference Result 2867 states and 4242 transitions. [2019-09-03 19:54:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-03 19:54:37,632 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 210 [2019-09-03 19:54:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:37,643 INFO L225 Difference]: With dead ends: 2867 [2019-09-03 19:54:37,643 INFO L226 Difference]: Without dead ends: 2862 [2019-09-03 19:54:37,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2019-09-03 19:54:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-03 19:54:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 213. [2019-09-03 19:54:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-03 19:54:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2019-09-03 19:54:37,680 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 210 [2019-09-03 19:54:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:37,681 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2019-09-03 19:54:37,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-03 19:54:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2019-09-03 19:54:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-03 19:54:37,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:54:37,682 INFO L399 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:54:37,683 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:54:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:54:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2073212190, now seen corresponding path program 50 times [2019-09-03 19:54:37,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:54:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:54:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:54:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:54:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:54:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2019-09-03 19:54:38,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:54:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2019-09-03 19:54:38,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-03 19:54:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-03 19:54:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:38,883 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand 52 states. [2019-09-03 19:54:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:54:39,087 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2019-09-03 19:54:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-03 19:54:39,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 212 [2019-09-03 19:54:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:54:39,089 INFO L225 Difference]: With dead ends: 312 [2019-09-03 19:54:39,089 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:54:39,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-03 19:54:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:54:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:54:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:54:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:54:39,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2019-09-03 19:54:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:54:39,091 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:54:39,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-03 19:54:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:54:39,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:54:39,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:54:39,974 WARN L188 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 1832 DAG size of output: 413 [2019-09-03 19:54:41,710 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 413 DAG size of output: 357 [2019-09-03 19:54:41,724 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:54:41,725 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:54:41,725 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:54:41,725 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:54:41,725 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:54:41,725 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:54:41,725 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2019-09-03 19:54:41,725 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2019-09-03 19:54:41,725 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-09-03 19:54:41,726 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-09-03 19:54:41,726 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2019-09-03 19:54:41,727 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (and (<= main_~x~0 99) (<= 99 main_~y~0) (<= main_~y~0 99)) (<= 99 main_~x~0)) (and (and (<= main_~y~0 92) (<= 92 main_~y~0) (<= main_~x~0 92)) (<= 92 main_~x~0)) (and (<= 65 main_~x~0) (and (<= main_~y~0 65) (<= 65 main_~y~0) (<= main_~x~0 65))) (and (and (<= main_~y~0 100) (< 99 main_~y~0)) (<= 100 main_~x~0)) (and (<= 64 main_~x~0) (and (<= main_~x~0 64) (<= 64 main_~y~0) (<= main_~y~0 64))) (and (<= 76 main_~x~0) (and (<= main_~y~0 76) (<= main_~x~0 76) (<= 76 main_~y~0))) (and (<= 87 main_~x~0) (and (<= main_~x~0 87) (<= main_~y~0 87) (<= 87 main_~y~0))) (and (and (<= main_~y~0 78) (<= 78 main_~y~0) (<= main_~x~0 78)) (<= 78 main_~x~0)) (and (<= 72 main_~x~0) (and (<= main_~y~0 72) (<= main_~x~0 72) (<= 72 main_~y~0))) (and (and (<= main_~y~0 69) (<= 69 main_~y~0) (<= main_~x~0 69)) (<= 69 main_~x~0)) (and (<= 60 main_~x~0) (and (<= main_~x~0 60) (<= main_~y~0 60) (<= 60 main_~y~0))) (and (<= 67 main_~x~0) (and (<= main_~y~0 67) (<= main_~x~0 67) (<= 67 main_~y~0))) (and (and (<= main_~y~0 55) (<= 55 main_~y~0) (<= main_~x~0 55)) (<= 55 main_~x~0)) (and (and (<= 73 main_~y~0) (<= main_~x~0 73) (<= main_~y~0 73)) (<= 73 main_~x~0)) (and (<= 66 main_~x~0) (and (<= main_~y~0 66) (<= 66 main_~y~0) (<= main_~x~0 66))) (and (and (<= main_~x~0 70) (<= main_~y~0 70) (<= 70 main_~y~0)) (<= 70 main_~x~0)) (and (and (<= main_~x~0 95) (<= main_~y~0 95) (<= 95 main_~y~0)) (<= 95 main_~x~0)) (and (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= main_~x~0 90)) (<= 90 main_~x~0)) (and (and (<= main_~y~0 59) (<= main_~x~0 59) (<= 59 main_~y~0)) (<= 59 main_~x~0)) (and (<= 85 main_~x~0) (and (<= 85 main_~y~0) (<= main_~x~0 85) (<= main_~y~0 85))) (and (<= 63 main_~x~0) (and (<= main_~y~0 63) (<= main_~x~0 63) (<= 63 main_~y~0))) (and (and (<= main_~y~0 77) (<= main_~x~0 77) (<= 77 main_~y~0)) (<= 77 main_~x~0)) (and (<= 53 main_~x~0) (and (<= main_~y~0 53) (<= main_~x~0 53) (<= 53 main_~y~0))) (and (and (<= main_~x~0 79) (<= main_~y~0 79) (<= 79 main_~y~0)) (<= 79 main_~x~0)) (and (<= 68 main_~x~0) (and (<= 68 main_~y~0) (<= main_~y~0 68) (<= main_~x~0 68))) (and (<= 51 main_~x~0) (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= main_~y~0 51))) (and (<= 54 main_~x~0) (and (<= main_~x~0 54) (<= 54 main_~y~0) (<= main_~y~0 54))) (and (and (<= 56 main_~y~0) (<= main_~x~0 56) (<= main_~y~0 56)) (<= 56 main_~x~0)) (and (<= 61 main_~x~0) (and (<= main_~y~0 61) (<= 61 main_~y~0) (<= main_~x~0 61))) (and (<= 88 main_~x~0) (and (<= main_~x~0 88) (<= main_~y~0 88) (<= 88 main_~y~0))) (and (<= main_~y~0 50) (<= main_~x~0 50) (<= 50 main_~y~0)) (and (<= 80 main_~x~0) (and (<= main_~x~0 80) (<= 80 main_~y~0) (<= main_~y~0 80))) (and (<= 94 main_~x~0) (and (<= main_~x~0 94) (<= main_~y~0 94) (<= 94 main_~y~0))) (and (<= 89 main_~x~0) (and (<= 89 main_~y~0) (<= main_~y~0 89) (<= main_~x~0 89))) (and (and (<= 86 main_~y~0) (<= main_~x~0 86) (<= main_~y~0 86)) (<= 86 main_~x~0)) (and (<= 58 main_~x~0) (and (<= main_~x~0 58) (<= main_~y~0 58) (<= 58 main_~y~0))) (and (and (<= main_~x~0 91) (<= 91 main_~y~0) (<= main_~y~0 91)) (<= 91 main_~x~0)) (and (and (<= 52 main_~y~0) (<= main_~y~0 52) (<= main_~x~0 52)) (<= 52 main_~x~0)) (and (<= 93 main_~x~0) (and (<= main_~x~0 93) (<= 93 main_~y~0) (<= main_~y~0 93))) (and (<= 74 main_~x~0) (and (<= 74 main_~y~0) (<= main_~y~0 74) (<= main_~x~0 74))) (and (and (<= main_~y~0 71) (<= main_~x~0 71) (<= 71 main_~y~0)) (<= 71 main_~x~0)) (and (<= 57 main_~x~0) (and (<= 57 main_~y~0) (<= main_~x~0 57) (<= main_~y~0 57))) (and (<= 97 main_~x~0) (and (<= 97 main_~y~0) (<= main_~x~0 97) (<= main_~y~0 97))) (and (and (<= main_~x~0 81) (<= 81 main_~y~0) (<= main_~y~0 81)) (<= 81 main_~x~0)) (and (<= 84 main_~x~0) (and (<= main_~y~0 84) (<= 84 main_~y~0) (<= main_~x~0 84))) (and (and (<= 96 main_~y~0) (<= main_~x~0 96) (<= main_~y~0 96)) (<= 96 main_~x~0)) (and (<= 83 main_~x~0) (and (<= main_~y~0 83) (<= 83 main_~y~0) (<= main_~x~0 83))) (and (<= 62 main_~x~0) (and (<= main_~y~0 62) (<= main_~x~0 62) (<= 62 main_~y~0))) (and (and (<= main_~x~0 98) (<= main_~y~0 98) (<= 98 main_~y~0)) (<= 98 main_~x~0)) (and (and (<= 75 main_~y~0) (<= main_~x~0 75) (<= main_~y~0 75)) (<= 75 main_~x~0)) (and (and (<= 82 main_~y~0) (<= main_~y~0 82) (<= main_~x~0 82)) (<= 82 main_~x~0))) [2019-09-03 19:54:41,727 INFO L439 ceAbstractionStarter]: At program point L13-2(lines 13 20) the Hoare annotation is: (and (<= main_~y~0 100) (< 99 main_~y~0)) [2019-09-03 19:54:41,728 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:54:41,728 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:54:41,728 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:54:41,728 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:54:41,728 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:54:41,728 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:54:41,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:54:41 BoogieIcfgContainer [2019-09-03 19:54:41,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:54:41,777 INFO L168 Benchmark]: Toolchain (without parser) took 65158.18 ms. Allocated memory was 133.2 MB in the beginning and 690.5 MB in the end (delta: 557.3 MB). Free memory was 88.9 MB in the beginning and 290.4 MB in the end (delta: -201.5 MB). Peak memory consumption was 574.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:41,778 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:54:41,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.47 ms. Allocated memory is still 133.2 MB. Free memory was 88.7 MB in the beginning and 79.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:41,779 INFO L168 Benchmark]: Boogie Preprocessor took 113.84 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 79.6 MB in the beginning and 177.3 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:41,780 INFO L168 Benchmark]: RCFGBuilder took 196.52 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 166.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:41,781 INFO L168 Benchmark]: TraceAbstraction took 64611.42 ms. Allocated memory was 200.3 MB in the beginning and 690.5 MB in the end (delta: 490.2 MB). Free memory was 166.1 MB in the beginning and 290.4 MB in the end (delta: -124.3 MB). Peak memory consumption was 584.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:54:41,787 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 232.47 ms. Allocated memory is still 133.2 MB. Free memory was 88.7 MB in the beginning and 79.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.84 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 79.6 MB in the beginning and 177.3 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 196.52 ms. Allocated memory is still 200.3 MB. Free memory was 177.3 MB in the beginning and 166.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64611.42 ms. Allocated memory was 200.3 MB in the beginning and 690.5 MB in the end (delta: 490.2 MB). Free memory was 166.1 MB in the beginning and 290.4 MB in the end (delta: -124.3 MB). Peak memory consumption was 584.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 99 && 99 <= y) && y <= 99) && 99 <= x) || (((y <= 92 && 92 <= y) && x <= 92) && 92 <= x)) || (65 <= x && (y <= 65 && 65 <= y) && x <= 65)) || ((y <= 100 && 99 < y) && 100 <= x)) || (64 <= x && (x <= 64 && 64 <= y) && y <= 64)) || (76 <= x && (y <= 76 && x <= 76) && 76 <= y)) || (87 <= x && (x <= 87 && y <= 87) && 87 <= y)) || (((y <= 78 && 78 <= y) && x <= 78) && 78 <= x)) || (72 <= x && (y <= 72 && x <= 72) && 72 <= y)) || (((y <= 69 && 69 <= y) && x <= 69) && 69 <= x)) || (60 <= x && (x <= 60 && y <= 60) && 60 <= y)) || (67 <= x && (y <= 67 && x <= 67) && 67 <= y)) || (((y <= 55 && 55 <= y) && x <= 55) && 55 <= x)) || (((73 <= y && x <= 73) && y <= 73) && 73 <= x)) || (66 <= x && (y <= 66 && 66 <= y) && x <= 66)) || (((x <= 70 && y <= 70) && 70 <= y) && 70 <= x)) || (((x <= 95 && y <= 95) && 95 <= y) && 95 <= x)) || (((90 <= y && y <= 90) && x <= 90) && 90 <= x)) || (((y <= 59 && x <= 59) && 59 <= y) && 59 <= x)) || (85 <= x && (85 <= y && x <= 85) && y <= 85)) || (63 <= x && (y <= 63 && x <= 63) && 63 <= y)) || (((y <= 77 && x <= 77) && 77 <= y) && 77 <= x)) || (53 <= x && (y <= 53 && x <= 53) && 53 <= y)) || (((x <= 79 && y <= 79) && 79 <= y) && 79 <= x)) || (68 <= x && (68 <= y && y <= 68) && x <= 68)) || (51 <= x && (51 <= y && x <= 51) && y <= 51)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((56 <= y && x <= 56) && y <= 56) && 56 <= x)) || (61 <= x && (y <= 61 && 61 <= y) && x <= 61)) || (88 <= x && (x <= 88 && y <= 88) && 88 <= y)) || ((y <= 50 && x <= 50) && 50 <= y)) || (80 <= x && (x <= 80 && 80 <= y) && y <= 80)) || (94 <= x && (x <= 94 && y <= 94) && 94 <= y)) || (89 <= x && (89 <= y && y <= 89) && x <= 89)) || (((86 <= y && x <= 86) && y <= 86) && 86 <= x)) || (58 <= x && (x <= 58 && y <= 58) && 58 <= y)) || (((x <= 91 && 91 <= y) && y <= 91) && 91 <= x)) || (((52 <= y && y <= 52) && x <= 52) && 52 <= x)) || (93 <= x && (x <= 93 && 93 <= y) && y <= 93)) || (74 <= x && (74 <= y && y <= 74) && x <= 74)) || (((y <= 71 && x <= 71) && 71 <= y) && 71 <= x)) || (57 <= x && (57 <= y && x <= 57) && y <= 57)) || (97 <= x && (97 <= y && x <= 97) && y <= 97)) || (((x <= 81 && 81 <= y) && y <= 81) && 81 <= x)) || (84 <= x && (y <= 84 && 84 <= y) && x <= 84)) || (((96 <= y && x <= 96) && y <= 96) && 96 <= x)) || (83 <= x && (y <= 83 && 83 <= y) && x <= 83)) || (62 <= x && (y <= 62 && x <= 62) && 62 <= y)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((75 <= y && x <= 75) && y <= 75) && 75 <= x)) || (((82 <= y && y <= 82) && x <= 82) && 82 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 64.5s OverallTime, 53 OverallIterations, 101 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 675 SDtfs, 879 SDslu, 12952 SDs, 0 SdLazy, 8471 SolverSat, 2283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7723 GetRequests, 5895 SyntacticMatches, 2 SemanticMatches, 1826 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 2661 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 59 PreInvPairs, 161 NumberOfFragments, 720 HoareAnnotationTreeSize, 59 FomulaSimplifications, 13374 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 220 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 12512 NumberOfCodeBlocks, 12438 NumberOfCodeBlocksAsserted, 1488 NumberOfCheckSat, 12409 ConstructedInterpolants, 0 QuantifiedInterpolants, 4246081 SizeOfPredicates, 16 NumberOfNonLiveVariables, 15352 ConjunctsInSsa, 1603 ConjunctsInUnsatCore, 103 InterpolantComputations, 4 PerfectInterpolantSequences, 288579/425245 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...