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-acceleration/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:43:30,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:43:30,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:43:30,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:43:30,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:43:30,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:43:30,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:43:30,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:43:30,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:43:30,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:43:30,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:43:30,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:43:30,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:43:30,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:43:30,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:43:30,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:43:30,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:43:30,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:43:30,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:43:30,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:43:30,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:43:30,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:43:30,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:43:30,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:43:30,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:43:30,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:43:30,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:43:30,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:43:30,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:43:30,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:43:30,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:43:30,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:43:30,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:43:30,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:43:30,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:43:30,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:43:30,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:43:30,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:43:30,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:43:30,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:43:30,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:43:30,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:43:30,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:43:30,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:43:30,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:43:30,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:43:30,336 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:43:30,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:43:30,336 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:43:30,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:43:30,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:43:30,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:43:30,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:43:30,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:43:30,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:43:30,337 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:43:30,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:43:30,338 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:43:30,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:43:30,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:43:30,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:43:30,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:43:30,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:43:30,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:43:30,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:43:30,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:43:30,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:43:30,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:43:30,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:43:30,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:43:30,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:43:30,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:43:30,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:43:30,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:43:30,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:43:30,385 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:43:30,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-05 11:43:30,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac5a870c/bc5d000a184042f89fdb44602748a4f3/FLAG1a26121df [2019-09-05 11:43:30,845 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:43:30,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2019-09-05 11:43:30,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac5a870c/bc5d000a184042f89fdb44602748a4f3/FLAG1a26121df [2019-09-05 11:43:31,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac5a870c/bc5d000a184042f89fdb44602748a4f3 [2019-09-05 11:43:31,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:43:31,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:43:31,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:43:31,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:43:31,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:43:31,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350286e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31, skipping insertion in model container [2019-09-05 11:43:31,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,284 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:43:31,298 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:43:31,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:43:31,443 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:43:31,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:43:31,476 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:43:31,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31 WrapperNode [2019-09-05 11:43:31,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:43:31,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:43:31,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:43:31,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:43:31,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... [2019-09-05 11:43:31,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:43:31,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:43:31,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:43:31,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:43:31,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:43:31,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:43:31,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:43:31,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:43:31,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:43:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:43:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:43:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:43:31,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:43:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:43:31,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:43:31,808 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:43:31,808 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:43:31,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:43:31 BoogieIcfgContainer [2019-09-05 11:43:31,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:43:31,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:43:31,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:43:31,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:43:31,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:43:31" (1/3) ... [2019-09-05 11:43:31,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3af7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:43:31, skipping insertion in model container [2019-09-05 11:43:31,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:43:31" (2/3) ... [2019-09-05 11:43:31,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3af7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:43:31, skipping insertion in model container [2019-09-05 11:43:31,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:43:31" (3/3) ... [2019-09-05 11:43:31,817 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2019-09-05 11:43:31,826 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:43:31,833 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:43:31,849 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:43:31,877 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:43:31,877 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:43:31,878 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:43:31,878 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:43:31,878 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:43:31,878 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:43:31,878 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:43:31,878 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:43:31,879 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:43:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 11:43:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:43:31,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:31,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:31,903 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:31,908 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 11:43:31,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:31,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:31,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:43:32,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:43:32,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:43:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:43:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:43:32,026 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 11:43:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:32,045 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-05 11:43:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:43:32,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 11:43:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:32,052 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:43:32,052 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:43:32,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:43:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:43:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:43:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:43:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 11:43:32,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 11:43:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:32,090 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 11:43:32,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:43:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 11:43:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:43:32,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:32,091 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:32,091 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 11:43:32,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:32,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:43:32,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:43:32,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:43:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:43:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:43:32,228 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 11:43:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:32,255 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-05 11:43:32,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:43:32,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:43:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:32,260 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:43:32,260 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:43:32,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:43:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:43:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-05 11:43:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 11:43:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-09-05 11:43:32,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-09-05 11:43:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:32,267 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-09-05 11:43:32,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:43:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-09-05 11:43:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:43:32,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:32,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:32,269 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:32,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 11:43:32,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:32,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:32,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:32,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:32,422 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-05 11:43:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:43:32,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:32,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:43:32,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:43:32,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:43:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:43:32,510 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-09-05 11:43:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:32,567 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-09-05 11:43:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:43:32,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 11:43:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:32,569 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:43:32,569 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:43:32,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:43:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:43:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-05 11:43:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:43:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-05 11:43:32,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-05 11:43:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:32,576 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-05 11:43:32,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:43:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-05 11:43:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:43:32,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:32,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:32,578 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1025597645, now seen corresponding path program 1 times [2019-09-05 11:43:32,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:32,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:32,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:32,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:32,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:32,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:43:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:32,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:43:32,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:43:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:43:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:43:32,745 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-09-05 11:43:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:32,787 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-05 11:43:32,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:43:32,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 11:43:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:32,788 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:43:32,789 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:43:32,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:43:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:43:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-09-05 11:43:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:43:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-05 11:43:32,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-05 11:43:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:32,794 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-05 11:43:32,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:43:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-05 11:43:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:43:32,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:32,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:32,796 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 11:43:32,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:32,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:32,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:32,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:32,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:32,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:32,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:32,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:43:32,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:33,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:33,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:43:33,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:43:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:43:33,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:33,009 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-05 11:43:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:33,069 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-09-05 11:43:33,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:43:33,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:43:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:33,070 INFO L225 Difference]: With dead ends: 24 [2019-09-05 11:43:33,070 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:43:33,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:43:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-09-05 11:43:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:43:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-05 11:43:33,076 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-09-05 11:43:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:33,076 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-05 11:43:33,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:43:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-05 11:43:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:43:33,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:33,078 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:33,078 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash -109889104, now seen corresponding path program 1 times [2019-09-05 11:43:33,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:33,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:33,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:33,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:33,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-05 11:43:33,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:43:33,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-05 11:43:33,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:43:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:43:33,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:33,240 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2019-09-05 11:43:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:33,315 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-09-05 11:43:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:33,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:43:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:33,317 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:43:33,317 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:43:33,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:43:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-09-05 11:43:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:43:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-05 11:43:33,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-09-05 11:43:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:33,324 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-05 11:43:33,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:43:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-05 11:43:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:43:33,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:33,325 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:33,326 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 2 times [2019-09-05 11:43:33,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:33,398 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-05 11:43:33,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:33,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:33,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:33,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-05 11:43:33,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:43:33,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-05 11:43:33,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:43:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:43:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:33,471 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2019-09-05 11:43:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:33,515 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-05 11:43:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:43:33,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:43:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:33,517 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:43:33,517 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:43:33,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:43:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-05 11:43:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-05 11:43:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-05 11:43:33,522 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2019-09-05 11:43:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:33,523 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-05 11:43:33,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:43:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-05 11:43:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:43:33,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:33,524 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:33,524 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash -919235730, now seen corresponding path program 2 times [2019-09-05 11:43:33,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:33,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:33,596 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) [2019-09-05 11:43:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:33,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:33,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:33,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:43:33,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:33,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:43:33,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:43:33,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:43:33,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:33,656 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2019-09-05 11:43:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:33,700 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-09-05 11:43:33,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:43:33,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:43:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:33,702 INFO L225 Difference]: With dead ends: 28 [2019-09-05 11:43:33,702 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:43:33,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:43:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:43:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-09-05 11:43:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:43:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-05 11:43:33,712 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-09-05 11:43:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:33,712 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-05 11:43:33,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:43:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-05 11:43:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:43:33,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:33,714 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:33,714 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:33,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-05 11:43:33,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:33,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:33,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:33,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:33,824 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:33,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:43:33,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:43:33,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:33,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:43:33,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:33,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:33,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:43:33,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:43:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:43:33,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:33,885 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2019-09-05 11:43:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:33,947 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-05 11:43:33,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:43:33,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 11:43:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:33,949 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:43:33,949 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:43:33,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:43:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-05 11:43:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:43:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-05 11:43:33,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-05 11:43:33,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:33,955 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-05 11:43:33,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:43:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-05 11:43:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:43:33,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:33,955 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:33,956 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 3 times [2019-09-05 11:43:33,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:33,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:33,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:33,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:34,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:43:34,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:43:34,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:34,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:43:34,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:34,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:43:34,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:43:34,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:43:34,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:34,080 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-09-05 11:43:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:34,135 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-09-05 11:43:34,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:34,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 11:43:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:34,136 INFO L225 Difference]: With dead ends: 32 [2019-09-05 11:43:34,136 INFO L226 Difference]: Without dead ends: 27 [2019-09-05 11:43:34,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:43:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-05 11:43:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-09-05 11:43:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:43:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-05 11:43:34,142 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-09-05 11:43:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:34,143 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-05 11:43:34,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:43:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-05 11:43:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:43:34,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:34,144 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:34,144 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2019-09-05 11:43:34,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:34,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:34,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:34,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:34,235 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-05 11:43:34,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:34,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:34,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:34,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:43:34,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:43:34,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:43:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:43:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:34,303 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2019-09-05 11:43:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:34,384 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-05 11:43:34,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:43:34,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 11:43:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:34,386 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:43:34,386 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:43:34,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:34,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:43:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-05 11:43:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:43:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-05 11:43:34,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2019-09-05 11:43:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:34,392 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-05 11:43:34,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:43:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-05 11:43:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:43:34,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:34,393 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:34,393 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 4 times [2019-09-05 11:43:34,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:34,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:34,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:34,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:34,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:34,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:34,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:34,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:43:34,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:34,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:43:34,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:43:34,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:43:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:34,531 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2019-09-05 11:43:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:34,609 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-05 11:43:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:43:34,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-09-05 11:43:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:34,610 INFO L225 Difference]: With dead ends: 36 [2019-09-05 11:43:34,610 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:43:34,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:43:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:43:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 11:43:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:43:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-05 11:43:34,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-09-05 11:43:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:34,616 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-05 11:43:34,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:43:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-05 11:43:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:43:34,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:34,617 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:34,617 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2019-09-05 11:43:34,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:34,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:34,778 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:43:34,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:34,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:43:34,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:34,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:34,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:43:34,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:43:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:43:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:34,811 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2019-09-05 11:43:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:34,907 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-05 11:43:34,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:43:34,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-05 11:43:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:34,908 INFO L225 Difference]: With dead ends: 38 [2019-09-05 11:43:34,909 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:43:34,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:43:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-05 11:43:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:43:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-05 11:43:34,919 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-09-05 11:43:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:34,919 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-05 11:43:34,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:43:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-05 11:43:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:43:34,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:34,921 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:34,921 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:34,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:34,921 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 5 times [2019-09-05 11:43:34,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:35,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:35,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:35,042 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:35,173 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:43:35,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:35,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:43:35,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:35,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:35,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:43:35,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:43:35,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:43:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:35,206 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2019-09-05 11:43:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:35,293 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-05 11:43:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:43:35,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-05 11:43:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:35,294 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:43:35,295 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 11:43:35,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:43:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 11:43:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-05 11:43:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-05 11:43:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-09-05 11:43:35,304 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2019-09-05 11:43:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:35,304 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-09-05 11:43:35,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:43:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-09-05 11:43:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:43:35,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:35,305 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:35,306 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2019-09-05 11:43:35,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:35,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:35,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:35,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:35,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:35,431 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) [2019-09-05 11:43:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:35,486 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:43:35,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:35,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:43:35,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:35,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:35,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:43:35,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:43:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:43:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:43:35,525 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2019-09-05 11:43:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:35,664 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-05 11:43:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:43:35,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-05 11:43:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:35,665 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:43:35,666 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:43:35,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:43:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:43:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-05 11:43:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 11:43:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-09-05 11:43:35,674 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2019-09-05 11:43:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:35,674 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-09-05 11:43:35,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:43:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-09-05 11:43:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:43:35,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:35,676 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:35,676 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1209734950, now seen corresponding path program 6 times [2019-09-05 11:43:35,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:35,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:35,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:35,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:35,786 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-05 11:43:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:35,827 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-05 11:43:35,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:35,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:43:35,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:35,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:35,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:43:35,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:43:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:43:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:43:35,856 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-09-05 11:43:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:35,952 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-05 11:43:35,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:43:35,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-05 11:43:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:35,954 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:43:35,954 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:43:35,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:43:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:43:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-05 11:43:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-05 11:43:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-09-05 11:43:35,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2019-09-05 11:43:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:35,964 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-09-05 11:43:35,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:43:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-09-05 11:43:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:43:35,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:35,965 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:35,966 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:35,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2019-09-05 11:43:35,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:35,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:35,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:36,098 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-05 11:43:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:36,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:43:36,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:36,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:36,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:43:36,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:43:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:43:36,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:43:36,158 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2019-09-05 11:43:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:36,292 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-05 11:43:36,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:43:36,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-05 11:43:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:36,294 INFO L225 Difference]: With dead ends: 46 [2019-09-05 11:43:36,294 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:43:36,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:43:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:43:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-05 11:43:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:43:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-09-05 11:43:36,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2019-09-05 11:43:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:36,309 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-09-05 11:43:36,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:43:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-09-05 11:43:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:43:36,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:36,310 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:36,310 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1781526699, now seen corresponding path program 7 times [2019-09-05 11:43:36,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:36,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:36,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:36,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:36,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:36,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:36,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:36,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 11:43:36,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:36,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:36,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:43:36,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:43:36,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:43:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:43:36,502 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 11 states. [2019-09-05 11:43:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:36,619 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-05 11:43:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:43:36,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-05 11:43:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:36,620 INFO L225 Difference]: With dead ends: 48 [2019-09-05 11:43:36,620 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 11:43:36,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:43:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 11:43:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-05 11:43:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-05 11:43:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-05 11:43:36,626 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2019-09-05 11:43:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:36,626 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-05 11:43:36,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:43:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-05 11:43:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:43:36,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:36,627 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:36,627 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2019-09-05 11:43:36,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:36,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:36,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:36,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:36,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:36,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:36,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:36,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:36,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:43:36,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:36,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:36,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:43:36,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:43:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:43:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:43:36,822 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 12 states. [2019-09-05 11:43:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:36,978 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-09-05 11:43:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:43:36,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 11:43:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:36,979 INFO L225 Difference]: With dead ends: 50 [2019-09-05 11:43:36,979 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 11:43:36,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:43:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 11:43:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-09-05 11:43:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 11:43:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-09-05 11:43:36,985 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2019-09-05 11:43:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:36,985 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-09-05 11:43:36,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:43:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-09-05 11:43:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:43:36,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:36,986 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:36,987 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583600, now seen corresponding path program 8 times [2019-09-05 11:43:36,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:36,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:37,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:37,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:37,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:37,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:37,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-05 11:43:37,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:37,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:37,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-05 11:43:37,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 11:43:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 11:43:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:43:37,171 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2019-09-05 11:43:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:37,367 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-05 11:43:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:43:37,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-09-05 11:43:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:37,368 INFO L225 Difference]: With dead ends: 52 [2019-09-05 11:43:37,368 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 11:43:37,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 11:43:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 11:43:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-05 11:43:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-05 11:43:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-05 11:43:37,373 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 26 [2019-09-05 11:43:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:37,373 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-05 11:43:37,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 11:43:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-05 11:43:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:43:37,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:37,374 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:37,375 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:37,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2019-09-05 11:43:37,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:37,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:37,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:37,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:37,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:37,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:37,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 11:43:37,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:37,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:43:37,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:37,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:37,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:43:37,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:43:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:43:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:37,608 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2019-09-05 11:43:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:37,785 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-09-05 11:43:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:43:37,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 11:43:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:37,786 INFO L225 Difference]: With dead ends: 54 [2019-09-05 11:43:37,786 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 11:43:37,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 11:43:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-09-05 11:43:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-05 11:43:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-09-05 11:43:37,797 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2019-09-05 11:43:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:37,798 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-09-05 11:43:37,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:43:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-09-05 11:43:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:43:37,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:37,799 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:37,799 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1271335925, now seen corresponding path program 9 times [2019-09-05 11:43:37,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:37,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:37,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:37,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:37,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:38,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 11:43:38,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:38,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-05 11:43:38,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:38,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:38,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-05 11:43:38,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:43:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:43:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:38,054 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2019-09-05 11:43:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:38,219 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-05 11:43:38,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:43:38,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-09-05 11:43:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:38,221 INFO L225 Difference]: With dead ends: 56 [2019-09-05 11:43:38,221 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 11:43:38,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:43:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 11:43:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 11:43:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 11:43:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-05 11:43:38,227 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 28 [2019-09-05 11:43:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:38,227 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-05 11:43:38,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:43:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-05 11:43:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:43:38,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:38,228 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:38,228 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2019-09-05 11:43:38,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:38,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:38,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:38,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:38,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:38,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:38,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:38,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:38,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:43:38,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:43:38,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:43:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:43:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:43:38,433 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2019-09-05 11:43:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:38,651 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-05 11:43:38,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:43:38,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-05 11:43:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:38,653 INFO L225 Difference]: With dead ends: 58 [2019-09-05 11:43:38,653 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 11:43:38,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:43:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 11:43:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-05 11:43:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 11:43:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-09-05 11:43:38,657 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2019-09-05 11:43:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:38,657 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-09-05 11:43:38,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:43:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-09-05 11:43:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:43:38,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:38,658 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:38,659 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash -850521530, now seen corresponding path program 10 times [2019-09-05 11:43:38,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:38,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:38,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:38,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:38,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:38,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:43:38,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:38,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:38,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:43:38,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:38,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:43:38,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:43:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:43:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:43:38,870 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 14 states. [2019-09-05 11:43:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:39,090 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-05 11:43:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:43:39,094 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-05 11:43:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:39,095 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:43:39,095 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 11:43:39,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:43:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 11:43:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-05 11:43:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 11:43:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-09-05 11:43:39,099 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 30 [2019-09-05 11:43:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:39,100 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-09-05 11:43:39,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:43:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-09-05 11:43:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:43:39,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:39,100 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:39,101 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2019-09-05 11:43:39,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:39,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:39,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:39,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:39,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:43:41,018 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 11:43:41,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:41,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:43:41,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:41,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:41,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:43:41,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:43:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:43:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:43:41,067 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 15 states. [2019-09-05 11:43:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:41,345 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-05 11:43:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:43:41,347 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-05 11:43:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:41,348 INFO L225 Difference]: With dead ends: 62 [2019-09-05 11:43:41,348 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:43:41,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:43:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:43:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-05 11:43:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 11:43:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-09-05 11:43:41,353 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 32 [2019-09-05 11:43:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:41,353 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-09-05 11:43:41,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:43:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-09-05 11:43:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:43:41,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:41,354 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:41,354 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash -174813759, now seen corresponding path program 11 times [2019-09-05 11:43:41,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:41,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:41,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:41,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:41,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:41,545 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-05 11:43:45,859 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 11:43:45,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:45,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-05 11:43:45,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:45,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:45,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-05 11:43:45,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:43:45,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:43:45,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:43:45,907 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 15 states. [2019-09-05 11:43:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:46,143 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-05 11:43:46,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:43:46,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-05 11:43:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:46,145 INFO L225 Difference]: With dead ends: 64 [2019-09-05 11:43:46,145 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 11:43:46,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:43:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 11:43:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-05 11:43:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-05 11:43:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-09-05 11:43:46,151 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2019-09-05 11:43:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:46,151 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-09-05 11:43:46,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:43:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-09-05 11:43:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:43:46,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:46,152 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:46,152 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2019-09-05 11:43:46,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:46,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:46,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:46,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:46,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:46,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:43:47,058 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:43:47,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:47,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:43:47,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:47,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:47,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:43:47,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:43:47,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:43:47,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:43:47,109 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 16 states. [2019-09-05 11:43:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:47,410 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-05 11:43:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-05 11:43:47,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 11:43:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:47,411 INFO L225 Difference]: With dead ends: 66 [2019-09-05 11:43:47,412 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 11:43:47,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:43:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 11:43:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-05 11:43:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:43:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-09-05 11:43:47,417 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-09-05 11:43:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:47,417 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-09-05 11:43:47,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:43:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-09-05 11:43:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-05 11:43:47,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:47,418 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:47,418 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:47,418 INFO L82 PathProgramCache]: Analyzing trace with hash 640292476, now seen corresponding path program 12 times [2019-09-05 11:43:47,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:47,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:47,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:47,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:47,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:47,595 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) [2019-09-05 11:43:47,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:48,300 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-05 11:43:48,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:48,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:43:48,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:48,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-05 11:43:48,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-05 11:43:48,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-05 11:43:48,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:43:48,345 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2019-09-05 11:43:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:48,613 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-05 11:43:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:43:48,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-09-05 11:43:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:48,614 INFO L225 Difference]: With dead ends: 68 [2019-09-05 11:43:48,615 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 11:43:48,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:43:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 11:43:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-09-05 11:43:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-05 11:43:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-05 11:43:48,619 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2019-09-05 11:43:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:48,623 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-05 11:43:48,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-05 11:43:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-05 11:43:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:43:48,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:48,624 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:48,625 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2019-09-05 11:43:48,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:48,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:48,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:48,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:48,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:48,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:48,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:43:48,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:48,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:48,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:43:48,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:43:48,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:43:48,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:43:48,899 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2019-09-05 11:43:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:49,252 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-09-05 11:43:49,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:43:49,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-05 11:43:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:49,254 INFO L225 Difference]: With dead ends: 70 [2019-09-05 11:43:49,254 INFO L226 Difference]: Without dead ends: 65 [2019-09-05 11:43:49,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:43:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-05 11:43:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-05 11:43:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 11:43:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-09-05 11:43:49,259 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 36 [2019-09-05 11:43:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:49,260 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-09-05 11:43:49,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:43:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-09-05 11:43:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:43:49,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:49,261 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:49,261 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2021630857, now seen corresponding path program 13 times [2019-09-05 11:43:49,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:49,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:49,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:49,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:49,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:43:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:49,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 11:43:49,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:49,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:49,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:43:49,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:43:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:43:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:43:49,552 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2019-09-05 11:43:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:49,821 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-09-05 11:43:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:43:49,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-09-05 11:43:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:49,823 INFO L225 Difference]: With dead ends: 72 [2019-09-05 11:43:49,823 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:43:49,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:43:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:43:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-05 11:43:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 11:43:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-05 11:43:49,828 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2019-09-05 11:43:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:49,828 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-05 11:43:49,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:43:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-05 11:43:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:43:49,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:49,829 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:49,829 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2019-09-05 11:43:49,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:49,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:43:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:50,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:50,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:43:50,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:50,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:50,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:43:50,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:43:50,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:50,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:43:50,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:43:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:43:50,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:43:50,126 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2019-09-05 11:43:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:50,559 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-09-05 11:43:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:43:50,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-05 11:43:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:50,560 INFO L225 Difference]: With dead ends: 74 [2019-09-05 11:43:50,560 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:43:50,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:43:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:43:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-05 11:43:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 11:43:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-05 11:43:50,565 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 38 [2019-09-05 11:43:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:50,565 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-05 11:43:50,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:43:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-05 11:43:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:43:50,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:50,566 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:50,566 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash -329445454, now seen corresponding path program 14 times [2019-09-05 11:43:50,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:50,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:50,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:50,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:50,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:50,794 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-05 11:43:50,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:50,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:43:50,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:50,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:43:50,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:50,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:50,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-05 11:43:50,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:43:50,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:43:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:43:50,864 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 18 states. [2019-09-05 11:43:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:51,162 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-09-05 11:43:51,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:43:51,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-09-05 11:43:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:51,164 INFO L225 Difference]: With dead ends: 76 [2019-09-05 11:43:51,164 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 11:43:51,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:43:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 11:43:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-05 11:43:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 11:43:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-05 11:43:51,170 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 38 [2019-09-05 11:43:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:51,170 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-05 11:43:51,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:43:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-05 11:43:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:43:51,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:51,171 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:51,172 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2019-09-05 11:43:51,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:51,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:51,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:51,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:51,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:51,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:51,457 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-05 11:43:51,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:52,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 11:43:52,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:52,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:43:52,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:52,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:52,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:43:52,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:43:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:43:52,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:43:52,132 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2019-09-05 11:43:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:52,800 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-09-05 11:43:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-05 11:43:52,800 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-05 11:43:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:52,801 INFO L225 Difference]: With dead ends: 78 [2019-09-05 11:43:52,801 INFO L226 Difference]: Without dead ends: 73 [2019-09-05 11:43:52,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:43:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-05 11:43:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-09-05 11:43:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-05 11:43:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-09-05 11:43:52,807 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 40 [2019-09-05 11:43:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:52,807 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-09-05 11:43:52,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:43:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-09-05 11:43:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:43:52,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:52,809 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:52,809 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1931878355, now seen corresponding path program 15 times [2019-09-05 11:43:52,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:52,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:52,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:52,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:53,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:53,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:53,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:43:58,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 11:43:58,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:58,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:43:58,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:58,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:58,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-05 11:43:58,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:43:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:43:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:43:58,701 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 19 states. [2019-09-05 11:43:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:59,066 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-09-05 11:43:59,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:43:59,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-05 11:43:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:59,067 INFO L225 Difference]: With dead ends: 80 [2019-09-05 11:43:59,067 INFO L226 Difference]: Without dead ends: 75 [2019-09-05 11:43:59,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:43:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-05 11:43:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-09-05 11:43:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-05 11:43:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-05 11:43:59,072 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 40 [2019-09-05 11:43:59,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:59,072 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-05 11:43:59,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:43:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-05 11:43:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:43:59,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:59,073 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:59,074 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:59,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2019-09-05 11:43:59,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:59,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:43:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:59,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:43:59,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:43:59,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:43:59,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:43:59,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:43:59,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:43:59,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:43:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:43:59,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:43:59,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:43:59,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:43:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:43:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:43:59,414 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 20 states. [2019-09-05 11:43:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:43:59,950 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-09-05 11:43:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:43:59,950 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 11:43:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:43:59,951 INFO L225 Difference]: With dead ends: 82 [2019-09-05 11:43:59,951 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 11:43:59,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:43:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 11:43:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-05 11:43:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-05 11:43:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-09-05 11:43:59,956 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2019-09-05 11:43:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:43:59,956 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-09-05 11:43:59,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:43:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-09-05 11:43:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:43:59,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:43:59,956 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:43:59,957 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:43:59,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:43:59,957 INFO L82 PathProgramCache]: Analyzing trace with hash 23363048, now seen corresponding path program 16 times [2019-09-05 11:43:59,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:43:59,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:43:59,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:59,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:43:59,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:43:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:00,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:00,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:44:00,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:44:00,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:44:00,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:44:00,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:44:00,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:44:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:00,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:44:00,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:44:00,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:44:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:44:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:44:00,316 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 20 states. [2019-09-05 11:44:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:44:00,739 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-09-05 11:44:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:44:00,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 11:44:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:44:00,741 INFO L225 Difference]: With dead ends: 84 [2019-09-05 11:44:00,741 INFO L226 Difference]: Without dead ends: 79 [2019-09-05 11:44:00,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:44:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-05 11:44:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-09-05 11:44:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-05 11:44:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-05 11:44:00,747 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 42 [2019-09-05 11:44:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:44:00,747 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-05 11:44:00,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:44:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-05 11:44:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:44:00,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:44:00,748 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:44:00,748 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:44:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:44:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2019-09-05 11:44:00,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:44:00,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:44:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:00,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:44:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:44:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:44:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:44:01,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:44:01,043 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-05 11:44:01,060 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:18,036 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 11:45:18,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:45:18,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:45:18,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:45:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:18,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:45:18,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:45:18,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:45:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:45:18,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:45:18,157 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2019-09-05 11:45:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:45:18,730 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2019-09-05 11:45:18,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:45:18,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-05 11:45:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:45:18,732 INFO L225 Difference]: With dead ends: 86 [2019-09-05 11:45:18,732 INFO L226 Difference]: Without dead ends: 81 [2019-09-05 11:45:18,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:45:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-05 11:45:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-09-05 11:45:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:45:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-09-05 11:45:18,736 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 44 [2019-09-05 11:45:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:45:18,736 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-09-05 11:45:18,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:45:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-09-05 11:45:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-05 11:45:18,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:45:18,737 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:45:18,738 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:45:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:45:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2109642979, now seen corresponding path program 17 times [2019-09-05 11:45:18,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:45:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:45:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:18,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:45:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:45:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:45:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:45:19,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:45:19,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:45:19,024 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:46:14,284 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-05 11:46:14,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:14,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:46:14,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:14,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:14,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-05 11:46:14,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:46:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:46:14,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:46:14,438 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2019-09-05 11:46:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:14,922 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2019-09-05 11:46:14,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:46:14,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-09-05 11:46:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:14,924 INFO L225 Difference]: With dead ends: 88 [2019-09-05 11:46:14,924 INFO L226 Difference]: Without dead ends: 83 [2019-09-05 11:46:14,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-09-05 11:46:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-05 11:46:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-09-05 11:46:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-05 11:46:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-05 11:46:14,929 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 44 [2019-09-05 11:46:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:14,930 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-05 11:46:14,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:46:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-05 11:46:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:46:14,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:14,931 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:14,931 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:14,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2019-09-05 11:46:14,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:14,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:14,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:15,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:15,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:15,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:46:15,691 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:46:15,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:15,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:46:15,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:15,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:15,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:46:15,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:46:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:46:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:46:15,738 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 22 states. [2019-09-05 11:46:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:16,389 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-09-05 11:46:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:46:16,391 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-05 11:46:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:16,392 INFO L225 Difference]: With dead ends: 90 [2019-09-05 11:46:16,392 INFO L226 Difference]: Without dead ends: 85 [2019-09-05 11:46:16,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:46:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-05 11:46:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-09-05 11:46:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-05 11:46:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-05 11:46:16,396 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 46 [2019-09-05 11:46:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:16,396 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-05 11:46:16,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:46:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-05 11:46:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:46:16,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:16,397 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:16,397 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1274929438, now seen corresponding path program 18 times [2019-09-05 11:46:16,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:16,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:16,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:16,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:16,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:16,710 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:46:20,747 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-05 11:46:20,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:20,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:46:20,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:20,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:20,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-05 11:46:20,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:46:20,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:46:20,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:46:20,809 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 22 states. [2019-09-05 11:46:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:21,334 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-09-05 11:46:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:46:21,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-09-05 11:46:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:21,336 INFO L225 Difference]: With dead ends: 92 [2019-09-05 11:46:21,336 INFO L226 Difference]: Without dead ends: 87 [2019-09-05 11:46:21,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:46:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-05 11:46:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-05 11:46:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-05 11:46:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-09-05 11:46:21,341 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 46 [2019-09-05 11:46:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:21,342 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-09-05 11:46:21,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:46:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-09-05 11:46:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:46:21,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:21,343 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:21,343 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2019-09-05 11:46:21,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:21,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:21,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:21,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:21,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:46:21,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:21,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:46:21,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:46:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:46:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:46:21,703 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 23 states. [2019-09-05 11:46:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:22,404 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2019-09-05 11:46:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:46:22,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-05 11:46:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:22,405 INFO L225 Difference]: With dead ends: 94 [2019-09-05 11:46:22,406 INFO L226 Difference]: Without dead ends: 89 [2019-09-05 11:46:22,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:46:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-05 11:46:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-05 11:46:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-05 11:46:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2019-09-05 11:46:22,411 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 48 [2019-09-05 11:46:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:22,411 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2019-09-05 11:46:22,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:46:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2019-09-05 11:46:22,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:46:22,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:22,412 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:22,412 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2020866407, now seen corresponding path program 19 times [2019-09-05 11:46:22,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:22,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:22,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:22,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:22,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:22,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:46:22,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:22,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:22,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:46:22,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:46:22,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:46:22,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:46:22,800 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 23 states. [2019-09-05 11:46:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:23,366 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-09-05 11:46:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:46:23,367 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-09-05 11:46:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:23,368 INFO L225 Difference]: With dead ends: 96 [2019-09-05 11:46:23,368 INFO L226 Difference]: Without dead ends: 91 [2019-09-05 11:46:23,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:46:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-05 11:46:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-05 11:46:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-05 11:46:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-09-05 11:46:23,374 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 48 [2019-09-05 11:46:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:23,374 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-09-05 11:46:23,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:46:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-09-05 11:46:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:46:23,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:23,375 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:23,375 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:23,376 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2019-09-05 11:46:23,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:23,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:23,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:23,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:23,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:23,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:46:23,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:46:23,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:23,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:46:23,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:23,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:23,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:46:23,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:46:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:46:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:46:23,781 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 24 states. [2019-09-05 11:46:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:24,526 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2019-09-05 11:46:24,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:46:24,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 11:46:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:24,528 INFO L225 Difference]: With dead ends: 98 [2019-09-05 11:46:24,528 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 11:46:24,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:46:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 11:46:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-05 11:46:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-05 11:46:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-09-05 11:46:24,532 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 50 [2019-09-05 11:46:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:24,532 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-09-05 11:46:24,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:46:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-09-05 11:46:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:46:24,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:24,533 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:24,533 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:24,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:24,533 INFO L82 PathProgramCache]: Analyzing trace with hash 405190996, now seen corresponding path program 20 times [2019-09-05 11:46:24,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:24,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:24,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:24,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:24,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:24,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:46:24,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:46:24,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:24,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-05 11:46:24,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:46:24,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:24,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-05 11:46:24,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:46:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:46:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:46:24,923 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 24 states. [2019-09-05 11:46:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:25,550 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-09-05 11:46:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:46:25,552 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-09-05 11:46:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:25,553 INFO L225 Difference]: With dead ends: 100 [2019-09-05 11:46:25,553 INFO L226 Difference]: Without dead ends: 95 [2019-09-05 11:46:25,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:46:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-05 11:46:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-05 11:46:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-05 11:46:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-05 11:46:25,558 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 50 [2019-09-05 11:46:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:25,558 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-05 11:46:25,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:46:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-05 11:46:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:46:25,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:25,559 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:25,559 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2019-09-05 11:46:25,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:25,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:25,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:25,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:25,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:25,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:46:29,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 11:46:29,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:29,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-05 11:46:29,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:29,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:46:29,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:46:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:46:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:46:29,330 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-09-05 11:46:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:30,134 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-09-05 11:46:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-05 11:46:30,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-05 11:46:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:30,139 INFO L225 Difference]: With dead ends: 102 [2019-09-05 11:46:30,139 INFO L226 Difference]: Without dead ends: 97 [2019-09-05 11:46:30,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:46:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-05 11:46:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-09-05 11:46:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-05 11:46:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2019-09-05 11:46:30,144 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 52 [2019-09-05 11:46:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:30,144 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2019-09-05 11:46:30,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:46:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2019-09-05 11:46:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:46:30,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:30,146 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:30,146 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -320886449, now seen corresponding path program 21 times [2019-09-05 11:46:30,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:30,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:30,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:30,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:30,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:30,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:46:48,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-05 11:46:48,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:48,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 11:46:48,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:48,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:48,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-05 11:46:48,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 11:46:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 11:46:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:46:48,646 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 25 states. [2019-09-05 11:46:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:49,309 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2019-09-05 11:46:49,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:46:49,310 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2019-09-05 11:46:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:49,311 INFO L225 Difference]: With dead ends: 104 [2019-09-05 11:46:49,311 INFO L226 Difference]: Without dead ends: 99 [2019-09-05 11:46:49,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-09-05 11:46:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-05 11:46:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-05 11:46:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-05 11:46:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-05 11:46:49,316 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 52 [2019-09-05 11:46:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:49,316 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-05 11:46:49,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 11:46:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-05 11:46:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:46:49,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:49,317 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:49,318 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2019-09-05 11:46:49,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:49,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:49,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:49,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:46:49,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:46:49,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:49,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:46:49,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:49,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:46:49,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:46:49,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:46:49,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:46:49,776 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 26 states. [2019-09-05 11:46:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:50,667 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2019-09-05 11:46:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:46:50,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-05 11:46:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:50,668 INFO L225 Difference]: With dead ends: 106 [2019-09-05 11:46:50,668 INFO L226 Difference]: Without dead ends: 101 [2019-09-05 11:46:50,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:46:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-05 11:46:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-05 11:46:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-05 11:46:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-09-05 11:46:50,673 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 54 [2019-09-05 11:46:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:50,673 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-09-05 11:46:50,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:46:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-09-05 11:46:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:46:50,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:50,674 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:50,674 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1998358154, now seen corresponding path program 22 times [2019-09-05 11:46:50,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:50,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:50,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:50,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:50,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:51,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:51,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:51,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:46:51,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:46:51,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:51,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 11:46:51,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:51,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:51,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-05 11:46:51,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-05 11:46:51,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-05 11:46:51,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:46:51,106 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 26 states. [2019-09-05 11:46:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:51,859 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-09-05 11:46:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:46:51,860 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2019-09-05 11:46:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:51,861 INFO L225 Difference]: With dead ends: 108 [2019-09-05 11:46:51,861 INFO L226 Difference]: Without dead ends: 103 [2019-09-05 11:46:51,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2019-09-05 11:46:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-05 11:46:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-09-05 11:46:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-05 11:46:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-05 11:46:51,866 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 54 [2019-09-05 11:46:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:51,867 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-05 11:46:51,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-05 11:46:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-05 11:46:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 11:46:51,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:51,867 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:51,867 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2019-09-05 11:46:51,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:51,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:51,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:51,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:52,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:52,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:52,385 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:47:49,957 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 11:47:49,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:50,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:47:50,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:50,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:50,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:47:50,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:47:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:47:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:47:50,063 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 27 states. [2019-09-05 11:47:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:51,021 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2019-09-05 11:47:51,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:47:51,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-05 11:47:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:51,023 INFO L225 Difference]: With dead ends: 110 [2019-09-05 11:47:51,023 INFO L226 Difference]: Without dead ends: 105 [2019-09-05 11:47:51,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:47:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-05 11:47:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-09-05 11:47:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-05 11:47:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-05 11:47:51,029 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 56 [2019-09-05 11:47:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:51,030 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-05 11:47:51,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:47:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-05 11:47:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-05 11:47:51,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:51,031 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:51,031 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:51,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:51,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1704395013, now seen corresponding path program 23 times [2019-09-05 11:47:51,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:51,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:51,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:51,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:51,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:47:51,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:51,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:47:51,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:50:25,301 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-05 11:50:25,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:25,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-05 11:50:25,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:25,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:25,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-05 11:50:25,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-05 11:50:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-05 11:50:25,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:50:25,405 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 27 states. [2019-09-05 11:50:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:26,232 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2019-09-05 11:50:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:50:26,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2019-09-05 11:50:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:26,234 INFO L225 Difference]: With dead ends: 112 [2019-09-05 11:50:26,234 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 11:50:26,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-09-05 11:50:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 11:50:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-09-05 11:50:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-05 11:50:26,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-05 11:50:26,240 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 56 [2019-09-05 11:50:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:26,240 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-05 11:50:26,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-05 11:50:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-05 11:50:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 11:50:26,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:26,241 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:26,241 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:26,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1795916016, now seen corresponding path program 24 times [2019-09-05 11:50:26,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:26,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:26,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:26,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:26,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:26,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:26,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:50:42,592 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 11:50:42,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:42,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:50:42,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:42,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:42,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:50:42,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:50:42,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:50:42,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:50:42,662 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 28 states. [2019-09-05 11:50:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:43,732 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-09-05 11:50:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:50:43,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 11:50:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:43,734 INFO L225 Difference]: With dead ends: 114 [2019-09-05 11:50:43,734 INFO L226 Difference]: Without dead ends: 109 [2019-09-05 11:50:43,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:50:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-05 11:50:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-05 11:50:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-05 11:50:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-09-05 11:50:43,739 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 58 [2019-09-05 11:50:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:43,739 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-09-05 11:50:43,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:50:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-09-05 11:50:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 11:50:43,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:43,740 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:43,740 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:43,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1621309248, now seen corresponding path program 24 times [2019-09-05 11:50:43,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:43,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:43,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:43,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:44,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:44,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:44,260 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:43,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-05 11:51:43,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:43,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:51:43,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:43,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:43,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-05 11:51:43,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:51:43,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:51:43,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:51:43,840 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 28 states. [2019-09-05 11:51:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:44,715 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2019-09-05 11:51:44,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:51:44,715 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 11:51:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:44,716 INFO L225 Difference]: With dead ends: 116 [2019-09-05 11:51:44,717 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 11:51:44,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:51:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 11:51:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-05 11:51:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-05 11:51:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-05 11:51:44,722 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 58 [2019-09-05 11:51:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:44,723 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-05 11:51:44,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:51:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-05 11:51:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 11:51:44,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:44,724 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:44,724 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 373770413, now seen corresponding path program 25 times [2019-09-05 11:51:44,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:44,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:45,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:45,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:45,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:51:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:45,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:51:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:45,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:51:45,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:51:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:51:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:51:45,225 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 29 states. [2019-09-05 11:51:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:46,370 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-09-05 11:51:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:51:46,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-05 11:51:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:46,372 INFO L225 Difference]: With dead ends: 118 [2019-09-05 11:51:46,372 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 11:51:46,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:51:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 11:51:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-05 11:51:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-05 11:51:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-09-05 11:51:46,375 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 60 [2019-09-05 11:51:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:46,376 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-09-05 11:51:46,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:51:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-09-05 11:51:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 11:51:46,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:46,376 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:46,377 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2127531451, now seen corresponding path program 25 times [2019-09-05 11:51:46,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:46,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:46,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:51:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:46,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:46,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:51:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:46,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-05 11:51:46,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:46,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:46,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-05 11:51:46,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:51:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:51:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:51:46,954 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 29 states. [2019-09-05 11:51:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:47,894 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-09-05 11:51:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:51:47,895 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-05 11:51:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:47,896 INFO L225 Difference]: With dead ends: 120 [2019-09-05 11:51:47,896 INFO L226 Difference]: Without dead ends: 115 [2019-09-05 11:51:47,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:51:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-05 11:51:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-09-05 11:51:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-05 11:51:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-05 11:51:47,899 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 60 [2019-09-05 11:51:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:47,899 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-05 11:51:47,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:51:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-05 11:51:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 11:51:47,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:47,900 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:47,900 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash -508553942, now seen corresponding path program 26 times [2019-09-05 11:51:47,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:47,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:47,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:51:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:48,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:48,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:48,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:51:48,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:51:48,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:51:48,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:48,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:48,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:51:48,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:51:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:51:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:51:48,867 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 30 states. [2019-09-05 11:51:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:50,356 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2019-09-05 11:51:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-05 11:51:50,357 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-05 11:51:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:50,358 INFO L225 Difference]: With dead ends: 122 [2019-09-05 11:51:50,359 INFO L226 Difference]: Without dead ends: 117 [2019-09-05 11:51:50,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:51:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-05 11:51:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-09-05 11:51:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-05 11:51:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2019-09-05 11:51:50,366 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 62 [2019-09-05 11:51:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:50,366 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2019-09-05 11:51:50,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:51:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2019-09-05 11:51:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 11:51:50,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:50,368 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:50,368 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1285881846, now seen corresponding path program 26 times [2019-09-05 11:51:50,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:50,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:50,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:50,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:50,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:51,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:51,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:51:51,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:51,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:51:51,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:51,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-05 11:51:51,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:51:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-05 11:51:51,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:51:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:51:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:51:51,341 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 30 states. [2019-09-05 11:51:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:51:52,303 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-09-05 11:51:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:51:52,303 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 62 [2019-09-05 11:51:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:51:52,304 INFO L225 Difference]: With dead ends: 124 [2019-09-05 11:51:52,304 INFO L226 Difference]: Without dead ends: 119 [2019-09-05 11:51:52,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:51:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-05 11:51:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-09-05 11:51:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-05 11:51:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2019-09-05 11:51:52,309 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 62 [2019-09-05 11:51:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:51:52,309 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2019-09-05 11:51:52,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:51:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2019-09-05 11:51:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 11:51:52,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:51:52,310 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:51:52,310 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:51:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:51:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1981265511, now seen corresponding path program 27 times [2019-09-05 11:51:52,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:51:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:51:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:52,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:51:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:51:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:52,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:52,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:52,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:52:08,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 11:52:08,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:52:08,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:52:08,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:52:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:52:08,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:52:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:52:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:52:08,141 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 31 states. [2019-09-05 11:52:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:52:09,444 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-09-05 11:52:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-05 11:52:09,444 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-05 11:52:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:52:09,445 INFO L225 Difference]: With dead ends: 126 [2019-09-05 11:52:09,446 INFO L226 Difference]: Without dead ends: 121 [2019-09-05 11:52:09,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:52:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-05 11:52:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-09-05 11:52:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 11:52:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-09-05 11:52:09,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 64 [2019-09-05 11:52:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:52:09,451 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-09-05 11:52:09,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:52:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-09-05 11:52:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 11:52:09,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:52:09,452 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:52:09,452 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:52:09,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:52:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash -85536911, now seen corresponding path program 27 times [2019-09-05 11:52:09,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:52:09,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:52:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:09,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:52:09,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:52:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:52:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:10,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:52:10,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:52:10,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:53:18,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-05 11:53:18,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:53:18,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 11:53:18,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:53:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:18,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:53:18,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-05 11:53:18,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:53:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:53:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:53:18,743 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 31 states. [2019-09-05 11:53:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:19,834 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-09-05 11:53:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:53:19,835 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2019-09-05 11:53:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:19,836 INFO L225 Difference]: With dead ends: 128 [2019-09-05 11:53:19,836 INFO L226 Difference]: Without dead ends: 123 [2019-09-05 11:53:19,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:53:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-05 11:53:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-05 11:53:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-05 11:53:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-05 11:53:19,843 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 64 [2019-09-05 11:53:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:19,843 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-05 11:53:19,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:53:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-05 11:53:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 11:53:19,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:19,844 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:19,844 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:19,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1893991324, now seen corresponding path program 28 times [2019-09-05 11:53:19,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:19,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:19,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:53:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:20,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:20,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:53:20,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:53:20,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:53:20,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:53:20,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 11:53:20,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:53:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:20,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:53:20,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:53:20,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:53:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:53:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:53:20,468 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 32 states. [2019-09-05 11:53:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:21,871 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-09-05 11:53:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:53:21,871 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 11:53:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:21,873 INFO L225 Difference]: With dead ends: 130 [2019-09-05 11:53:21,873 INFO L226 Difference]: Without dead ends: 125 [2019-09-05 11:53:21,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:53:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-05 11:53:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-05 11:53:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-05 11:53:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-09-05 11:53:21,879 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 66 [2019-09-05 11:53:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:21,879 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-09-05 11:53:21,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:53:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-09-05 11:53:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 11:53:21,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:21,880 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:21,880 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash 535997484, now seen corresponding path program 28 times [2019-09-05 11:53:21,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:21,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:21,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:53:21,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:22,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:22,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:53:22,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:53:22,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:53:22,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:53:22,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-05 11:53:22,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:53:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:22,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:53:22,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-05 11:53:22,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:53:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:53:22,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:53:22,464 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 32 states. [2019-09-05 11:53:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:23,691 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-09-05 11:53:23,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:53:23,692 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-09-05 11:53:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:23,693 INFO L225 Difference]: With dead ends: 132 [2019-09-05 11:53:23,693 INFO L226 Difference]: Without dead ends: 127 [2019-09-05 11:53:23,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:53:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-05 11:53:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-09-05 11:53:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-05 11:53:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-05 11:53:23,698 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 66 [2019-09-05 11:53:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:23,698 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-05 11:53:23,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:53:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-05 11:53:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 11:53:23,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:23,700 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:23,700 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:23,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2015803169, now seen corresponding path program 29 times [2019-09-05 11:53:23,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:23,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:23,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:53:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:53:24,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:24,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:53:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:56:53,254 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-05 11:56:53,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:56:53,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-05 11:56:53,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:56:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:56:53,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:56:53,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-05 11:56:53,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:56:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:56:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:56:53,465 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 33 states. [2019-09-05 11:56:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:56:54,930 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2019-09-05 11:56:54,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-05 11:56:54,930 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2019-09-05 11:56:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:56:54,932 INFO L225 Difference]: With dead ends: 134 [2019-09-05 11:56:54,932 INFO L226 Difference]: Without dead ends: 129 [2019-09-05 11:56:54,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:56:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-05 11:56:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-09-05 11:56:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-05 11:56:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-09-05 11:56:54,937 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 68 [2019-09-05 11:56:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:56:54,937 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-09-05 11:56:54,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:56:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-09-05 11:56:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 11:56:54,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:56:54,938 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:56:54,938 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:56:54,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:56:54,939 INFO L82 PathProgramCache]: Analyzing trace with hash 830096935, now seen corresponding path program 29 times [2019-09-05 11:56:54,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:56:54,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:56:54,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:54,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:56:54,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:56:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:56:55,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:56:55,729 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:56:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000