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/array-industry-pattern/array_of_struct_loop_dep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:46:58,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:46:58,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:46:58,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:46:58,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:46:58,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:46:58,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:46:58,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:46:58,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:46:58,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:46:58,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:46:58,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:46:58,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:46:58,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:46:58,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:46:58,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:46:58,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:46:58,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:46:58,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:46:58,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:46:58,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:46:58,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:46:58,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:46:58,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:46:58,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:46:58,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:46:58,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:46:58,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:46:58,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:46:58,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:46:58,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:46:58,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:46:58,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:46:58,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:46:58,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:46:58,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:46:58,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:46:58,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:46:58,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:46:58,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:46:58,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:46:58,424 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-07 10:46:58,439 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:46:58,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:46:58,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:46:58,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:46:58,441 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:46:58,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:46:58,441 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:46:58,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:46:58,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:46:58,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:46:58,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:46:58,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:46:58,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:46:58,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:46:58,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:46:58,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:46:58,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:46:58,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:46:58,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:46:58,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:46:58,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:46:58,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:46:58,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:46:58,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:46:58,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:46:58,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:46:58,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:46:58,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:46:58,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:46:58,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:46:58,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:46:58,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:46:58,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:46:58,500 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:46:58,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_loop_dep.i [2019-09-07 10:46:58,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f01e278/46a33ea50a394b5db47c0a51276427da/FLAGb699f8ae9 [2019-09-07 10:46:59,000 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:46:59,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_loop_dep.i [2019-09-07 10:46:59,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f01e278/46a33ea50a394b5db47c0a51276427da/FLAGb699f8ae9 [2019-09-07 10:46:59,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f01e278/46a33ea50a394b5db47c0a51276427da [2019-09-07 10:46:59,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:46:59,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:46:59,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:46:59,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:46:59,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:46:59,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:46:59" (1/1) ... [2019-09-07 10:46:59,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17114e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:59, skipping insertion in model container [2019-09-07 10:46:59,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:46:59" (1/1) ... [2019-09-07 10:46:59,432 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:46:59,447 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:46:59,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:47:02,047 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:47:02,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:47:02,100 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:47:02,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02 WrapperNode [2019-09-07 10:47:02,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:47:02,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:47:02,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:47:02,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:47:02,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (1/1) ... [2019-09-07 10:47:02,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:47:02,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:47:02,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:47:02,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:47:02,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (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-07 10:47:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:47:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:47:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:47:02,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:47:02,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:47:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:47:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:47:02,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:47:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:47:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:47:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:47:02,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:47:02,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:47:02,530 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:47:02,530 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 10:47:02,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:47:02 BoogieIcfgContainer [2019-09-07 10:47:02,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:47:02,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:47:02,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:47:02,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:47:02,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:46:59" (1/3) ... [2019-09-07 10:47:02,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72485b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:47:02, skipping insertion in model container [2019-09-07 10:47:02,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:47:02" (2/3) ... [2019-09-07 10:47:02,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72485b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:47:02, skipping insertion in model container [2019-09-07 10:47:02,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:47:02" (3/3) ... [2019-09-07 10:47:02,540 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_loop_dep.i [2019-09-07 10:47:02,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:47:02,557 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:47:02,573 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:47:02,605 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:47:02,606 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:47:02,606 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:47:02,606 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:47:02,606 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:47:02,607 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:47:02,607 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:47:02,607 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:47:02,607 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:47:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-07 10:47:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 10:47:02,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:02,627 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:02,629 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash -423135907, now seen corresponding path program 1 times [2019-09-07 10:47:02,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:02,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:02,767 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-07 10:47:02,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:47:02,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:47:02,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:47:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:47:02,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:47:02,790 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-07 10:47:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:02,814 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-09-07 10:47:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:47:02,815 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-07 10:47:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:02,824 INFO L225 Difference]: With dead ends: 42 [2019-09-07 10:47:02,824 INFO L226 Difference]: Without dead ends: 20 [2019-09-07 10:47:02,827 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-07 10:47:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-07 10:47:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-07 10:47:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-07 10:47:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-07 10:47:02,867 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2019-09-07 10:47:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:02,867 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-07 10:47:02,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:47:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-07 10:47:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 10:47:02,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:02,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:02,869 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:02,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1453190697, now seen corresponding path program 1 times [2019-09-07 10:47:02,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:02,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:02,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:02,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:02,928 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-07 10:47:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:47:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:47:02,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:47:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:47:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:47:02,932 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2019-09-07 10:47:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:02,972 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-09-07 10:47:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:47:02,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-07 10:47:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:02,975 INFO L225 Difference]: With dead ends: 39 [2019-09-07 10:47:02,976 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 10:47:02,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:47:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 10:47:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-07 10:47:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:47:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-07 10:47:02,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 13 [2019-09-07 10:47:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:02,986 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-07 10:47:02,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:47:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-07 10:47:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:47:02,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:02,988 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:02,989 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -769700427, now seen corresponding path program 1 times [2019-09-07 10:47:02,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:02,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:02,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:02,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:03,087 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-07 10:47:03,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:03,087 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-07 10:47:03,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:03,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:47:03,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:03,188 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-07 10:47:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:03,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:47:03,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:47:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:47:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:47:03,202 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-07 10:47:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:03,261 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-09-07 10:47:03,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:47:03,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-07 10:47:03,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:03,262 INFO L225 Difference]: With dead ends: 50 [2019-09-07 10:47:03,263 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:47:03,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:47:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:47:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-07 10:47:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:47:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 10:47:03,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 15 [2019-09-07 10:47:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:03,271 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 10:47:03,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:47:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 10:47:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:47:03,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:03,273 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:03,273 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1065547245, now seen corresponding path program 2 times [2019-09-07 10:47:03,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:03,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:03,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:03,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:03,324 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-07 10:47:03,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:03,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:03,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:03,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:03,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:03,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:47:03,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:03,445 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 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:47:03,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:03,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:47:03,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:47:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:47:03,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:47:03,454 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-07 10:47:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:03,618 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2019-09-07 10:47:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:47:03,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-07 10:47:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:03,620 INFO L225 Difference]: With dead ends: 62 [2019-09-07 10:47:03,620 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 10:47:03,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:47:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 10:47:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-07 10:47:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 10:47:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-07 10:47:03,638 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2019-09-07 10:47:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:03,638 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-07 10:47:03,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:47:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-07 10:47:03,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:47:03,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:03,641 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:03,641 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:03,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:03,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1906497807, now seen corresponding path program 3 times [2019-09-07 10:47:03,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:03,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:03,755 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-07 10:47:03,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:03,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:47:03,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:47:03,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:03,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:47:03,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 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-07 10:47:03,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:03,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:47:03,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:47:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:47:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:47:03,821 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2019-09-07 10:47:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:03,902 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-09-07 10:47:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:47:03,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-07 10:47:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:03,904 INFO L225 Difference]: With dead ends: 74 [2019-09-07 10:47:03,904 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:47:03,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:47:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:47:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-07 10:47:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:47:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-09-07 10:47:03,913 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 19 [2019-09-07 10:47:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:03,913 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-09-07 10:47:03,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:47:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-09-07 10:47:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 10:47:03,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:03,915 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:03,915 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1688831055, now seen corresponding path program 4 times [2019-09-07 10:47:03,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:03,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:03,990 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-07 10:47:03,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:03,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:04,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:04,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:04,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:04,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:47:04,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:04,061 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-07 10:47:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:47:04,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:47:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:47:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:47:04,069 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 8 states. [2019-09-07 10:47:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:04,158 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-09-07 10:47:04,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:47:04,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-09-07 10:47:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:04,161 INFO L225 Difference]: With dead ends: 86 [2019-09-07 10:47:04,161 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 10:47:04,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:47:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 10:47:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-09-07 10:47:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 10:47:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-09-07 10:47:04,171 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 21 [2019-09-07 10:47:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:04,171 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-09-07 10:47:04,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:47:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-09-07 10:47:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:47:04,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:04,172 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:04,173 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:04,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash -648805843, now seen corresponding path program 5 times [2019-09-07 10:47:04,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:04,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:04,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:04,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:04,275 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-07 10:47:04,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:04,276 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-07 10:47:04,287 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:47:04,331 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 10:47:04,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:04,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:47:04,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:47:04,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:04,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:47:04,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:47:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:47:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:47:04,359 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 9 states. [2019-09-07 10:47:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:04,496 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-09-07 10:47:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:47:04,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-09-07 10:47:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:04,498 INFO L225 Difference]: With dead ends: 98 [2019-09-07 10:47:04,498 INFO L226 Difference]: Without dead ends: 62 [2019-09-07 10:47:04,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:47:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-07 10:47:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-09-07 10:47:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 10:47:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-09-07 10:47:04,524 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 23 [2019-09-07 10:47:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:04,525 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-09-07 10:47:04,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:47:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-09-07 10:47:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 10:47:04,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:04,526 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:04,526 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash -849969013, now seen corresponding path program 6 times [2019-09-07 10:47:04,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:04,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:04,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:04,648 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-07 10:47:04,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:04,649 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-07 10:47:04,665 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:04,706 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:47:04,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:04,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:47:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:04,726 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-07 10:47:04,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:04,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:47:04,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:47:04,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:47:04,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:47:04,733 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 10 states. [2019-09-07 10:47:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:04,871 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2019-09-07 10:47:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:47:04,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-07 10:47:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:04,873 INFO L225 Difference]: With dead ends: 110 [2019-09-07 10:47:04,873 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 10:47:04,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:47:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 10:47:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-07 10:47:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:47:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-09-07 10:47:04,893 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 25 [2019-09-07 10:47:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:04,894 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-09-07 10:47:04,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:47:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-09-07 10:47:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:47:04,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:04,895 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:04,895 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash -894247063, now seen corresponding path program 7 times [2019-09-07 10:47:04,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:04,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:04,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:04,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:05,035 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-07 10:47:05,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:05,036 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-07 10:47:05,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:05,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:47:05,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:05,094 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-07 10:47:05,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:05,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:47:05,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:47:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:47:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:47:05,103 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 11 states. [2019-09-07 10:47:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:05,230 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-09-07 10:47:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:47:05,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-07 10:47:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:05,232 INFO L225 Difference]: With dead ends: 122 [2019-09-07 10:47:05,232 INFO L226 Difference]: Without dead ends: 76 [2019-09-07 10:47:05,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:47:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-07 10:47:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-07 10:47:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 10:47:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-09-07 10:47:05,253 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 27 [2019-09-07 10:47:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:05,253 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-09-07 10:47:05,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:47:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-09-07 10:47:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 10:47:05,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:05,254 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:05,255 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash -495780153, now seen corresponding path program 8 times [2019-09-07 10:47:05,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:05,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:05,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:05,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:05,385 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-07 10:47:05,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:05,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:05,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:05,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:05,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:05,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:47:05,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:05,452 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-07 10:47:05,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:05,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:47:05,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:47:05,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:47:05,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:47:05,458 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 12 states. [2019-09-07 10:47:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:05,615 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2019-09-07 10:47:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:47:05,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-09-07 10:47:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:05,617 INFO L225 Difference]: With dead ends: 134 [2019-09-07 10:47:05,617 INFO L226 Difference]: Without dead ends: 83 [2019-09-07 10:47:05,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:47:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-07 10:47:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-09-07 10:47:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 10:47:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2019-09-07 10:47:05,626 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 29 [2019-09-07 10:47:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:05,626 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2019-09-07 10:47:05,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:47:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2019-09-07 10:47:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 10:47:05,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:05,627 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:05,628 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:05,628 INFO L82 PathProgramCache]: Analyzing trace with hash 178831013, now seen corresponding path program 9 times [2019-09-07 10:47:05,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:05,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:05,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:05,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:05,721 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-07 10:47:05,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:05,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:05,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:05,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:47:05,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:05,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:47:05,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:05,805 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-07 10:47:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:05,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:47:05,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:47:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:47:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:47:05,817 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 13 states. [2019-09-07 10:47:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:05,963 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2019-09-07 10:47:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:47:05,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-09-07 10:47:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:05,965 INFO L225 Difference]: With dead ends: 146 [2019-09-07 10:47:05,965 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 10:47:05,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:47:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 10:47:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-07 10:47:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:47:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2019-09-07 10:47:05,974 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 31 [2019-09-07 10:47:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:05,974 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2019-09-07 10:47:05,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:47:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2019-09-07 10:47:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 10:47:05,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:05,976 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:05,976 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash -59900157, now seen corresponding path program 10 times [2019-09-07 10:47:05,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:05,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:05,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:05,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:05,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:06,075 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-07 10:47:06,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:06,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:06,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:06,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:06,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:06,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:47:06,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:06,134 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-07 10:47:06,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:06,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:47:06,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:47:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:47:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:47:06,147 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 14 states. [2019-09-07 10:47:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:06,312 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2019-09-07 10:47:06,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:47:06,313 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-09-07 10:47:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:06,314 INFO L225 Difference]: With dead ends: 158 [2019-09-07 10:47:06,314 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 10:47:06,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:47:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 10:47:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-09-07 10:47:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 10:47:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2019-09-07 10:47:06,331 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 33 [2019-09-07 10:47:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:06,332 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2019-09-07 10:47:06,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:47:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2019-09-07 10:47:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:47:06,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:06,333 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:06,333 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1847287839, now seen corresponding path program 11 times [2019-09-07 10:47:06,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:06,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:06,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:06,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:06,466 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-07 10:47:06,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:06,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:06,477 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:47:06,530 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:47:06,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:06,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:47:06,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:06,551 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-07 10:47:06,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:06,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:47:06,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:47:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:47:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:47:06,562 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand 15 states. [2019-09-07 10:47:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:06,708 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2019-09-07 10:47:06,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:47:06,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-09-07 10:47:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:06,710 INFO L225 Difference]: With dead ends: 170 [2019-09-07 10:47:06,711 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 10:47:06,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:47:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 10:47:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-09-07 10:47:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 10:47:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2019-09-07 10:47:06,719 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 35 [2019-09-07 10:47:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:06,719 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2019-09-07 10:47:06,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:47:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2019-09-07 10:47:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 10:47:06,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:06,720 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:06,721 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1539931841, now seen corresponding path program 12 times [2019-09-07 10:47:06,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:06,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:06,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:06,845 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-07 10:47:06,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:06,846 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) [2019-09-07 10:47:06,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:06,945 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:47:06,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:06,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:47:06,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:06,969 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-07 10:47:06,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:06,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:47:06,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:47:06,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:47:06,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:47:06,975 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 16 states. [2019-09-07 10:47:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:07,153 INFO L93 Difference]: Finished difference Result 182 states and 212 transitions. [2019-09-07 10:47:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:47:07,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-09-07 10:47:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:07,156 INFO L225 Difference]: With dead ends: 182 [2019-09-07 10:47:07,156 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 10:47:07,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:47:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 10:47:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-09-07 10:47:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 10:47:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-09-07 10:47:07,163 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 37 [2019-09-07 10:47:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:07,164 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-09-07 10:47:07,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:47:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-09-07 10:47:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:47:07,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:07,165 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:07,165 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1771406109, now seen corresponding path program 13 times [2019-09-07 10:47:07,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:07,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:07,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:07,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:07,288 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-07 10:47:07,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:07,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:07,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:47:07,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:07,359 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-07 10:47:07,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:07,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:47:07,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:47:07,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:47:07,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:47:07,365 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 17 states. [2019-09-07 10:47:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:07,575 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2019-09-07 10:47:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:47:07,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-09-07 10:47:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:07,577 INFO L225 Difference]: With dead ends: 194 [2019-09-07 10:47:07,578 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 10:47:07,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:47:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 10:47:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-09-07 10:47:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 10:47:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2019-09-07 10:47:07,585 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 39 [2019-09-07 10:47:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:07,586 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2019-09-07 10:47:07,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:47:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2019-09-07 10:47:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 10:47:07,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:07,587 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:07,587 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:07,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1396409723, now seen corresponding path program 14 times [2019-09-07 10:47:07,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:07,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:07,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:07,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:07,750 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-07 10:47:07,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:07,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:07,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:07,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:07,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:07,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:47:07,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:07,827 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-07 10:47:07,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:07,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:47:07,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:47:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:47:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:47:07,832 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 18 states. [2019-09-07 10:47:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:08,080 INFO L93 Difference]: Finished difference Result 206 states and 240 transitions. [2019-09-07 10:47:08,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:47:08,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-09-07 10:47:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:08,083 INFO L225 Difference]: With dead ends: 206 [2019-09-07 10:47:08,083 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 10:47:08,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:47:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 10:47:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-09-07 10:47:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-07 10:47:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2019-09-07 10:47:08,091 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 41 [2019-09-07 10:47:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:08,091 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2019-09-07 10:47:08,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:47:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2019-09-07 10:47:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:47:08,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:08,092 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:08,093 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1802135641, now seen corresponding path program 15 times [2019-09-07 10:47:08,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:08,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:08,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:08,241 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-07 10:47:08,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:08,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:08,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:47:08,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 10:47:08,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:08,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:47:08,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:08,443 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-07 10:47:08,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:08,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:47:08,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:47:08,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:47:08,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:47:08,449 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand 19 states. [2019-09-07 10:47:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:08,762 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2019-09-07 10:47:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:47:08,762 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2019-09-07 10:47:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:08,764 INFO L225 Difference]: With dead ends: 218 [2019-09-07 10:47:08,764 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 10:47:08,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:47:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 10:47:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-09-07 10:47:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-07 10:47:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2019-09-07 10:47:08,772 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 43 [2019-09-07 10:47:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:08,772 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2019-09-07 10:47:08,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:47:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2019-09-07 10:47:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 10:47:08,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:08,773 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:08,774 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 862718903, now seen corresponding path program 16 times [2019-09-07 10:47:08,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:08,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:08,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:08,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:08,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:08,996 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-07 10:47:08,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:08,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:09,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:09,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:09,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:09,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:47:09,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:47:09,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:09,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:47:09,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:47:09,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:47:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:47:09,070 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 20 states. [2019-09-07 10:47:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:09,277 INFO L93 Difference]: Finished difference Result 230 states and 268 transitions. [2019-09-07 10:47:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:47:09,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2019-09-07 10:47:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:09,278 INFO L225 Difference]: With dead ends: 230 [2019-09-07 10:47:09,278 INFO L226 Difference]: Without dead ends: 139 [2019-09-07 10:47:09,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:47:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-07 10:47:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-09-07 10:47:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 10:47:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2019-09-07 10:47:09,287 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 45 [2019-09-07 10:47:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:09,288 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2019-09-07 10:47:09,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:47:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2019-09-07 10:47:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:47:09,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:09,290 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:09,290 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 26365845, now seen corresponding path program 17 times [2019-09-07 10:47:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:09,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:09,601 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-07 10:47:09,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:09,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:09,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:09,786 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-07 10:47:09,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:09,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:47:09,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:09,815 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-07 10:47:09,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:09,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:47:09,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:47:09,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:47:09,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:47:09,824 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 21 states. [2019-09-07 10:47:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:10,059 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2019-09-07 10:47:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:47:10,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-09-07 10:47:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:10,061 INFO L225 Difference]: With dead ends: 242 [2019-09-07 10:47:10,061 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 10:47:10,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:47:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 10:47:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-09-07 10:47:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-07 10:47:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2019-09-07 10:47:10,069 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 47 [2019-09-07 10:47:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:10,069 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2019-09-07 10:47:10,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:47:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2019-09-07 10:47:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 10:47:10,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:10,070 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:10,071 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash -550038541, now seen corresponding path program 18 times [2019-09-07 10:47:10,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:10,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:10,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:10,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:10,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:10,257 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-07 10:47:10,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:10,258 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-07 10:47:10,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:47:10,628 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:47:10,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:10,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:47:10,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:10,649 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-07 10:47:10,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:10,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:47:10,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:47:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:47:10,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:47:10,656 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand 22 states. [2019-09-07 10:47:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:10,902 INFO L93 Difference]: Finished difference Result 254 states and 296 transitions. [2019-09-07 10:47:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:47:10,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2019-09-07 10:47:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:10,904 INFO L225 Difference]: With dead ends: 254 [2019-09-07 10:47:10,904 INFO L226 Difference]: Without dead ends: 153 [2019-09-07 10:47:10,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:47:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-07 10:47:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-09-07 10:47:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 10:47:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2019-09-07 10:47:10,913 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 49 [2019-09-07 10:47:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:10,913 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2019-09-07 10:47:10,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:47:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2019-09-07 10:47:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 10:47:10,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:10,914 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:10,915 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash -423872303, now seen corresponding path program 19 times [2019-09-07 10:47:10,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:10,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:10,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:11,226 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-07 10:47:11,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:11,226 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-07 10:47:11,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:11,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:47:11,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:11,328 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-07 10:47:11,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:11,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:47:11,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:47:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:47:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:47:11,336 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand 23 states. [2019-09-07 10:47:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:11,664 INFO L93 Difference]: Finished difference Result 266 states and 310 transitions. [2019-09-07 10:47:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:47:11,665 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2019-09-07 10:47:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:11,666 INFO L225 Difference]: With dead ends: 266 [2019-09-07 10:47:11,666 INFO L226 Difference]: Without dead ends: 160 [2019-09-07 10:47:11,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:47:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-07 10:47:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-09-07 10:47:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-07 10:47:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2019-09-07 10:47:11,679 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 51 [2019-09-07 10:47:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:11,679 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2019-09-07 10:47:11,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:47:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2019-09-07 10:47:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 10:47:11,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:11,680 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:11,681 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 562798127, now seen corresponding path program 20 times [2019-09-07 10:47:11,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:11,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:11,928 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-07 10:47:11,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:11,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:11,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:47:11,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:11,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:11,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:47:11,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:11,985 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-07 10:47:11,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:11,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:47:11,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:47:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:47:11,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:47:11,999 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 24 states. [2019-09-07 10:47:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:12,340 INFO L93 Difference]: Finished difference Result 278 states and 324 transitions. [2019-09-07 10:47:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:47:12,343 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2019-09-07 10:47:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:12,345 INFO L225 Difference]: With dead ends: 278 [2019-09-07 10:47:12,345 INFO L226 Difference]: Without dead ends: 167 [2019-09-07 10:47:12,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:47:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-07 10:47:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2019-09-07 10:47:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-07 10:47:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2019-09-07 10:47:12,354 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 53 [2019-09-07 10:47:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:12,355 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2019-09-07 10:47:12,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:47:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2019-09-07 10:47:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 10:47:12,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:12,355 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:12,356 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash -434691059, now seen corresponding path program 21 times [2019-09-07 10:47:12,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:12,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:12,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:12,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:12,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:12,624 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-07 10:47:12,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:12,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:12,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:47:13,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-07 10:47:13,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:13,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:47:13,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:13,025 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-07 10:47:13,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:13,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:47:13,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:47:13,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:47:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:47:13,031 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand 25 states. [2019-09-07 10:47:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:13,357 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2019-09-07 10:47:13,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:47:13,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-09-07 10:47:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:13,359 INFO L225 Difference]: With dead ends: 290 [2019-09-07 10:47:13,359 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 10:47:13,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:47:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 10:47:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-09-07 10:47:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-07 10:47:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2019-09-07 10:47:13,367 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 55 [2019-09-07 10:47:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:13,367 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2019-09-07 10:47:13,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:47:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2019-09-07 10:47:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 10:47:13,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:13,368 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:13,369 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:13,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:13,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1244091797, now seen corresponding path program 22 times [2019-09-07 10:47:13,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:13,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:13,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:13,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:13,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:13,766 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-07 10:47:13,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:13,767 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-07 10:47:13,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:13,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:13,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:13,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:47:13,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:13,877 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-07 10:47:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:47:13,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:47:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:47:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:47:13,884 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand 26 states. [2019-09-07 10:47:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:14,292 INFO L93 Difference]: Finished difference Result 302 states and 352 transitions. [2019-09-07 10:47:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:47:14,293 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2019-09-07 10:47:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:14,294 INFO L225 Difference]: With dead ends: 302 [2019-09-07 10:47:14,294 INFO L226 Difference]: Without dead ends: 181 [2019-09-07 10:47:14,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:47:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-07 10:47:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-09-07 10:47:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-07 10:47:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2019-09-07 10:47:14,306 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 57 [2019-09-07 10:47:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:14,306 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2019-09-07 10:47:14,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:47:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2019-09-07 10:47:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:47:14,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:14,307 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:14,307 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1689120439, now seen corresponding path program 23 times [2019-09-07 10:47:14,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:14,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:14,671 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-07 10:47:14,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:14,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:14,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:15,564 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-07 10:47:15,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:15,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:47:15,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:15,584 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-07 10:47:15,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:15,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:47:15,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:47:15,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:47:15,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:47:15,592 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand 27 states. [2019-09-07 10:47:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:15,983 INFO L93 Difference]: Finished difference Result 314 states and 366 transitions. [2019-09-07 10:47:15,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:47:15,988 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2019-09-07 10:47:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:15,990 INFO L225 Difference]: With dead ends: 314 [2019-09-07 10:47:15,990 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 10:47:15,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:47:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 10:47:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-07 10:47:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-07 10:47:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2019-09-07 10:47:15,999 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 59 [2019-09-07 10:47:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:15,999 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2019-09-07 10:47:15,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:47:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2019-09-07 10:47:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 10:47:16,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:16,000 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:16,000 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:16,001 INFO L82 PathProgramCache]: Analyzing trace with hash 135084199, now seen corresponding path program 24 times [2019-09-07 10:47:16,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:16,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:16,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:16,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:16,372 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-07 10:47:16,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:16,372 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-07 10:47:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:17,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:47:17,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:17,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:47:17,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:17,687 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-07 10:47:17,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:17,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:47:17,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:47:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:47:17,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:47:17,696 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 28 states. [2019-09-07 10:47:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:18,020 INFO L93 Difference]: Finished difference Result 326 states and 380 transitions. [2019-09-07 10:47:18,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:47:18,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-09-07 10:47:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:18,023 INFO L225 Difference]: With dead ends: 326 [2019-09-07 10:47:18,023 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 10:47:18,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:47:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 10:47:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-09-07 10:47:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-07 10:47:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 220 transitions. [2019-09-07 10:47:18,033 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 220 transitions. Word has length 61 [2019-09-07 10:47:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:18,034 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 220 transitions. [2019-09-07 10:47:18,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:47:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 220 transitions. [2019-09-07 10:47:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:47:18,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:18,035 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:18,035 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:18,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash 849084549, now seen corresponding path program 25 times [2019-09-07 10:47:18,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:18,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:18,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:18,387 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-07 10:47:18,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:18,387 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-07 10:47:18,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:18,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:47:18,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:18,489 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-07 10:47:18,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:18,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:47:18,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:47:18,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:47:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:47:18,502 INFO L87 Difference]: Start difference. First operand 193 states and 220 transitions. Second operand 29 states. [2019-09-07 10:47:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:19,021 INFO L93 Difference]: Finished difference Result 338 states and 394 transitions. [2019-09-07 10:47:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:47:19,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2019-09-07 10:47:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:19,023 INFO L225 Difference]: With dead ends: 338 [2019-09-07 10:47:19,023 INFO L226 Difference]: Without dead ends: 202 [2019-09-07 10:47:19,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:47:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-07 10:47:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-09-07 10:47:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-07 10:47:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 228 transitions. [2019-09-07 10:47:19,032 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 228 transitions. Word has length 63 [2019-09-07 10:47:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:19,032 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 228 transitions. [2019-09-07 10:47:19,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:47:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 228 transitions. [2019-09-07 10:47:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 10:47:19,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:19,033 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:19,033 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash -191346461, now seen corresponding path program 26 times [2019-09-07 10:47:19,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:19,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:19,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:19,430 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-07 10:47:19,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:19,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:19,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:19,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:19,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:47:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:19,505 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-07 10:47:19,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:19,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:47:19,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:47:19,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:47:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:47:19,512 INFO L87 Difference]: Start difference. First operand 200 states and 228 transitions. Second operand 30 states. [2019-09-07 10:47:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:19,930 INFO L93 Difference]: Finished difference Result 350 states and 408 transitions. [2019-09-07 10:47:19,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:47:19,930 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-09-07 10:47:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:19,932 INFO L225 Difference]: With dead ends: 350 [2019-09-07 10:47:19,932 INFO L226 Difference]: Without dead ends: 209 [2019-09-07 10:47:19,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:47:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-07 10:47:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-09-07 10:47:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-07 10:47:19,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 236 transitions. [2019-09-07 10:47:19,941 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 236 transitions. Word has length 65 [2019-09-07 10:47:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:19,941 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 236 transitions. [2019-09-07 10:47:19,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:47:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 236 transitions. [2019-09-07 10:47:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:47:19,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:19,942 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:19,943 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash 681832897, now seen corresponding path program 27 times [2019-09-07 10:47:19,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:19,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:19,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:20,379 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-07 10:47:20,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:20,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:47:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:22,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-07 10:47:22,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:22,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:47:22,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:22,868 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-07 10:47:22,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:22,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:47:22,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:47:22,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:47:22,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:47:22,876 INFO L87 Difference]: Start difference. First operand 207 states and 236 transitions. Second operand 31 states. [2019-09-07 10:47:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:23,294 INFO L93 Difference]: Finished difference Result 362 states and 422 transitions. [2019-09-07 10:47:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:47:23,295 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 67 [2019-09-07 10:47:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:23,296 INFO L225 Difference]: With dead ends: 362 [2019-09-07 10:47:23,296 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 10:47:23,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:47:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 10:47:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2019-09-07 10:47:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-07 10:47:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2019-09-07 10:47:23,305 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 67 [2019-09-07 10:47:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:23,306 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2019-09-07 10:47:23,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:47:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2019-09-07 10:47:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 10:47:23,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:23,307 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:23,307 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2006394081, now seen corresponding path program 28 times [2019-09-07 10:47:23,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:23,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:23,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:23,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:23,665 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-07 10:47:23,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:23,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:23,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:23,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:23,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:23,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:47:23,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:23,743 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-07 10:47:23,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:23,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:47:23,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:47:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:47:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:47:23,748 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand 32 states. [2019-09-07 10:47:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:24,333 INFO L93 Difference]: Finished difference Result 374 states and 436 transitions. [2019-09-07 10:47:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:47:24,333 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-09-07 10:47:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:24,335 INFO L225 Difference]: With dead ends: 374 [2019-09-07 10:47:24,335 INFO L226 Difference]: Without dead ends: 223 [2019-09-07 10:47:24,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:47:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-07 10:47:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-07 10:47:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-07 10:47:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 252 transitions. [2019-09-07 10:47:24,345 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 252 transitions. Word has length 69 [2019-09-07 10:47:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:24,345 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 252 transitions. [2019-09-07 10:47:24,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:47:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 252 transitions. [2019-09-07 10:47:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:47:24,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:24,346 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:24,346 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash 177792253, now seen corresponding path program 29 times [2019-09-07 10:47:24,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:24,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:24,749 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-07 10:47:24,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:24,749 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-07 10:47:24,760 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:47:26,913 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-07 10:47:26,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:26,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:47:26,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:26,934 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-07 10:47:26,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:26,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:47:26,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:47:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:47:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:47:26,941 INFO L87 Difference]: Start difference. First operand 221 states and 252 transitions. Second operand 33 states. [2019-09-07 10:47:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:27,374 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2019-09-07 10:47:27,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:47:27,374 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2019-09-07 10:47:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:27,376 INFO L225 Difference]: With dead ends: 386 [2019-09-07 10:47:27,376 INFO L226 Difference]: Without dead ends: 230 [2019-09-07 10:47:27,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:47:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-09-07 10:47:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-09-07 10:47:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-07 10:47:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions. [2019-09-07 10:47:27,385 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 71 [2019-09-07 10:47:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:27,385 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions. [2019-09-07 10:47:27,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:47:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions. [2019-09-07 10:47:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 10:47:27,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:27,386 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:27,387 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1058148517, now seen corresponding path program 30 times [2019-09-07 10:47:27,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:27,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:27,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:27,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:27,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:27,899 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:47:36,595 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 10:47:36,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:36,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:47:36,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:47:36,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:47:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:47:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:47:36,639 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand 34 states. [2019-09-07 10:47:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:37,240 INFO L93 Difference]: Finished difference Result 398 states and 464 transitions. [2019-09-07 10:47:37,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:47:37,240 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2019-09-07 10:47:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:37,242 INFO L225 Difference]: With dead ends: 398 [2019-09-07 10:47:37,243 INFO L226 Difference]: Without dead ends: 237 [2019-09-07 10:47:37,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:47:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-07 10:47:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2019-09-07 10:47:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-07 10:47:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2019-09-07 10:47:37,254 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 73 [2019-09-07 10:47:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:37,254 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2019-09-07 10:47:37,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:47:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2019-09-07 10:47:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:47:37,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:37,255 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:37,255 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash 908712505, now seen corresponding path program 31 times [2019-09-07 10:47:37,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:37,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:37,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:37,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:37,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:37,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:37,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:37,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:47:37,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:37,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:47:37,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:47:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:47:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:47:37,767 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand 35 states. [2019-09-07 10:47:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:38,419 INFO L93 Difference]: Finished difference Result 410 states and 478 transitions. [2019-09-07 10:47:38,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:47:38,420 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2019-09-07 10:47:38,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:38,422 INFO L225 Difference]: With dead ends: 410 [2019-09-07 10:47:38,422 INFO L226 Difference]: Without dead ends: 244 [2019-09-07 10:47:38,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:47:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-07 10:47:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-09-07 10:47:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 10:47:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2019-09-07 10:47:38,432 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 75 [2019-09-07 10:47:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:38,433 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2019-09-07 10:47:38,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:47:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2019-09-07 10:47:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 10:47:38,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:38,434 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:38,434 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:38,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1276544407, now seen corresponding path program 32 times [2019-09-07 10:47:38,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:38,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:38,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:47:38,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:47:38,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:38,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:38,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:47:38,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (33)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:47:38,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:38,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:47:38,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:47:38,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:47:38,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:47:38,969 INFO L87 Difference]: Start difference. First operand 242 states and 276 transitions. Second operand 36 states. [2019-09-07 10:47:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:39,514 INFO L93 Difference]: Finished difference Result 422 states and 492 transitions. [2019-09-07 10:47:39,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:47:39,514 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2019-09-07 10:47:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:39,516 INFO L225 Difference]: With dead ends: 422 [2019-09-07 10:47:39,516 INFO L226 Difference]: Without dead ends: 251 [2019-09-07 10:47:39,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:47:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-07 10:47:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-09-07 10:47:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-07 10:47:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 284 transitions. [2019-09-07 10:47:39,528 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 284 transitions. Word has length 77 [2019-09-07 10:47:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:39,528 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 284 transitions. [2019-09-07 10:47:39,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:47:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 284 transitions. [2019-09-07 10:47:39,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:47:39,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:39,529 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:39,530 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:39,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1719283339, now seen corresponding path program 33 times [2019-09-07 10:47:39,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:39,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:39,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:40,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:40,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:47:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:47:51,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-07 10:47:51,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:51,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:47:51,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:51,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:51,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:47:51,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:47:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:47:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:47:51,324 INFO L87 Difference]: Start difference. First operand 249 states and 284 transitions. Second operand 37 states. [2019-09-07 10:47:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:51,894 INFO L93 Difference]: Finished difference Result 434 states and 506 transitions. [2019-09-07 10:47:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:47:51,894 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 79 [2019-09-07 10:47:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:51,896 INFO L225 Difference]: With dead ends: 434 [2019-09-07 10:47:51,896 INFO L226 Difference]: Without dead ends: 258 [2019-09-07 10:47:51,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:47:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-07 10:47:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-07 10:47:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-07 10:47:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 292 transitions. [2019-09-07 10:47:51,906 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 292 transitions. Word has length 79 [2019-09-07 10:47:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:51,907 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 292 transitions. [2019-09-07 10:47:51,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:47:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 292 transitions. [2019-09-07 10:47:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 10:47:51,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:51,908 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:51,908 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1213308371, now seen corresponding path program 34 times [2019-09-07 10:47:51,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:51,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:51,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:52,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:52,424 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-07 10:47:52,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:52,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:52,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:52,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:47:52,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:52,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:52,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:47:52,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:47:52,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:47:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:47:52,493 INFO L87 Difference]: Start difference. First operand 256 states and 292 transitions. Second operand 38 states. [2019-09-07 10:47:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:53,237 INFO L93 Difference]: Finished difference Result 446 states and 520 transitions. [2019-09-07 10:47:53,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:47:53,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 81 [2019-09-07 10:47:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:53,240 INFO L225 Difference]: With dead ends: 446 [2019-09-07 10:47:53,240 INFO L226 Difference]: Without dead ends: 265 [2019-09-07 10:47:53,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:47:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-07 10:47:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2019-09-07 10:47:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 10:47:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 300 transitions. [2019-09-07 10:47:53,249 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 300 transitions. Word has length 81 [2019-09-07 10:47:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:53,250 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 300 transitions. [2019-09-07 10:47:53,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:47:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 300 transitions. [2019-09-07 10:47:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:47:53,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:53,251 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:53,251 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1935395505, now seen corresponding path program 35 times [2019-09-07 10:47:53,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:53,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:53,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:53,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:53,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:53,963 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:47:57,918 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-07 10:47:57,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:57,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:47:57,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:57,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:57,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-07 10:47:57,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:47:57,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:47:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:47:57,963 INFO L87 Difference]: Start difference. First operand 263 states and 300 transitions. Second operand 39 states. [2019-09-07 10:47:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:58,754 INFO L93 Difference]: Finished difference Result 458 states and 534 transitions. [2019-09-07 10:47:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 10:47:58,755 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2019-09-07 10:47:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:58,757 INFO L225 Difference]: With dead ends: 458 [2019-09-07 10:47:58,757 INFO L226 Difference]: Without dead ends: 272 [2019-09-07 10:47:58,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:47:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-07 10:47:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2019-09-07 10:47:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-07 10:47:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 308 transitions. [2019-09-07 10:47:58,767 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 308 transitions. Word has length 83 [2019-09-07 10:47:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:58,768 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 308 transitions. [2019-09-07 10:47:58,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:47:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 308 transitions. [2019-09-07 10:47:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 10:47:58,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:58,769 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:58,769 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash 76429327, now seen corresponding path program 36 times [2019-09-07 10:47:58,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:58,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:58,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:59,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:59,464 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-07 10:47:59,475 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:48:23,745 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 10:48:23,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:23,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:48:23,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:23,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:23,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:23,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 10:48:23,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:48:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:48:23,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:48:23,804 INFO L87 Difference]: Start difference. First operand 270 states and 308 transitions. Second operand 40 states. [2019-09-07 10:48:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:24,478 INFO L93 Difference]: Finished difference Result 470 states and 548 transitions. [2019-09-07 10:48:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:48:24,479 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2019-09-07 10:48:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:24,481 INFO L225 Difference]: With dead ends: 470 [2019-09-07 10:48:24,482 INFO L226 Difference]: Without dead ends: 279 [2019-09-07 10:48:24,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:48:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-07 10:48:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2019-09-07 10:48:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-07 10:48:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 316 transitions. [2019-09-07 10:48:24,492 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 316 transitions. Word has length 85 [2019-09-07 10:48:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:24,492 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 316 transitions. [2019-09-07 10:48:24,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:48:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 316 transitions. [2019-09-07 10:48:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 10:48:24,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:24,493 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:24,494 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 316327405, now seen corresponding path program 37 times [2019-09-07 10:48:24,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:24,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:25,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:25,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 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-07 10:48:25,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:48:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:25,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:48:25,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:25,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:25,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:48:25,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:48:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:48:25,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:48:25,190 INFO L87 Difference]: Start difference. First operand 277 states and 316 transitions. Second operand 41 states. [2019-09-07 10:48:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:26,009 INFO L93 Difference]: Finished difference Result 482 states and 562 transitions. [2019-09-07 10:48:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:48:26,010 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-09-07 10:48:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:26,011 INFO L225 Difference]: With dead ends: 482 [2019-09-07 10:48:26,012 INFO L226 Difference]: Without dead ends: 286 [2019-09-07 10:48:26,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:48:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-07 10:48:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-07 10:48:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-07 10:48:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2019-09-07 10:48:26,021 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 87 [2019-09-07 10:48:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:26,021 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2019-09-07 10:48:26,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:48:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2019-09-07 10:48:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 10:48:26,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:26,023 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:26,023 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1069853621, now seen corresponding path program 38 times [2019-09-07 10:48:26,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:26,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:26,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:48:26,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:26,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:26,726 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-07 10:48:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:48:26,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:48:26,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:26,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:48:26,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:26,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:26,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-07 10:48:26,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:48:26,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:48:26,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:48:26,805 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 42 states. [2019-09-07 10:48:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:27,464 INFO L93 Difference]: Finished difference Result 494 states and 576 transitions. [2019-09-07 10:48:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:48:27,464 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2019-09-07 10:48:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:27,466 INFO L225 Difference]: With dead ends: 494 [2019-09-07 10:48:27,466 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 10:48:27,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:48:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 10:48:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2019-09-07 10:48:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-07 10:48:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 332 transitions. [2019-09-07 10:48:27,477 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 332 transitions. Word has length 89 [2019-09-07 10:48:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:27,477 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 332 transitions. [2019-09-07 10:48:27,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:48:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 332 transitions. [2019-09-07 10:48:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:48:27,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:27,478 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:27,479 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1749957847, now seen corresponding path program 39 times [2019-09-07 10:48:27,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:27,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:27,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:28,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:28,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:48:28,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:48:47,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-07 10:48:47,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:47,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:48:47,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:47,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 10:48:47,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:48:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:48:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:48:47,264 INFO L87 Difference]: Start difference. First operand 291 states and 332 transitions. Second operand 43 states. [2019-09-07 10:48:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:48,002 INFO L93 Difference]: Finished difference Result 506 states and 590 transitions. [2019-09-07 10:48:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:48:48,002 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 91 [2019-09-07 10:48:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:48,004 INFO L225 Difference]: With dead ends: 506 [2019-09-07 10:48:48,004 INFO L226 Difference]: Without dead ends: 300 [2019-09-07 10:48:48,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:48:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-07 10:48:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-09-07 10:48:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-07 10:48:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 340 transitions. [2019-09-07 10:48:48,016 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 340 transitions. Word has length 91 [2019-09-07 10:48:48,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:48,017 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 340 transitions. [2019-09-07 10:48:48,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:48:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 340 transitions. [2019-09-07 10:48:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 10:48:48,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:48,018 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:48,018 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:48,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1799877255, now seen corresponding path program 40 times [2019-09-07 10:48:48,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:48,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:48,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:48,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:48,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:48,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:48,825 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-07 10:48:48,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:48:48,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:48:48,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:48,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:48:48,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:48:48,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:48,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-07 10:48:48,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:48:48,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:48:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:48:48,905 INFO L87 Difference]: Start difference. First operand 298 states and 340 transitions. Second operand 44 states. [2019-09-07 10:48:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:49,836 INFO L93 Difference]: Finished difference Result 518 states and 604 transitions. [2019-09-07 10:48:49,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:48:49,836 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-09-07 10:48:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:49,839 INFO L225 Difference]: With dead ends: 518 [2019-09-07 10:48:49,839 INFO L226 Difference]: Without dead ends: 307 [2019-09-07 10:48:49,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:48:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-07 10:48:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-09-07 10:48:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-07 10:48:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 348 transitions. [2019-09-07 10:48:49,855 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 348 transitions. Word has length 93 [2019-09-07 10:48:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:49,856 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 348 transitions. [2019-09-07 10:48:49,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:48:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 348 transitions. [2019-09-07 10:48:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:48:49,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:49,858 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:49,858 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1307590043, now seen corresponding path program 41 times [2019-09-07 10:48:49,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:49,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:49,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:51,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:51,249 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-07 10:48:51,273 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:49:07,891 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-07 10:49:07,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:07,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:49:07,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:49:07,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:07,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-07 10:49:07,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:49:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:49:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:49:07,973 INFO L87 Difference]: Start difference. First operand 305 states and 348 transitions. Second operand 45 states. [2019-09-07 10:49:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:49:08,860 INFO L93 Difference]: Finished difference Result 530 states and 618 transitions. [2019-09-07 10:49:08,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:49:08,861 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 95 [2019-09-07 10:49:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:49:08,862 INFO L225 Difference]: With dead ends: 530 [2019-09-07 10:49:08,862 INFO L226 Difference]: Without dead ends: 314 [2019-09-07 10:49:08,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:49:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-07 10:49:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-07 10:49:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-07 10:49:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 356 transitions. [2019-09-07 10:49:08,872 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 356 transitions. Word has length 95 [2019-09-07 10:49:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:49:08,873 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 356 transitions. [2019-09-07 10:49:08,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:49:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 356 transitions. [2019-09-07 10:49:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 10:49:08,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:49:08,874 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:49:08,874 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:49:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:49:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1713574595, now seen corresponding path program 42 times [2019-09-07 10:49:08,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:49:08,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:49:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:08,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:49:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:49:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:49:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:49:09,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:49:09,663 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-07 10:49:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:50:35,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 10:50:35,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:50:35,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:50:35,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:50:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:35,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:50:35,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 10:50:35,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:50:35,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:50:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:50:35,965 INFO L87 Difference]: Start difference. First operand 312 states and 356 transitions. Second operand 46 states. [2019-09-07 10:50:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:50:36,740 INFO L93 Difference]: Finished difference Result 542 states and 632 transitions. [2019-09-07 10:50:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:50:36,743 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 97 [2019-09-07 10:50:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:50:36,744 INFO L225 Difference]: With dead ends: 542 [2019-09-07 10:50:36,744 INFO L226 Difference]: Without dead ends: 321 [2019-09-07 10:50:36,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:50:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-07 10:50:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2019-09-07 10:50:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-07 10:50:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 364 transitions. [2019-09-07 10:50:36,754 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 364 transitions. Word has length 97 [2019-09-07 10:50:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:50:36,755 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 364 transitions. [2019-09-07 10:50:36,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:50:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 364 transitions. [2019-09-07 10:50:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:50:36,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:50:36,756 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:50:36,756 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:50:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:50:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1654899617, now seen corresponding path program 43 times [2019-09-07 10:50:36,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:50:36,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:50:36,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:36,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:50:36,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:37,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:50:37,705 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-07 10:50:37,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:50:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:37,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:50:37,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:50:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:37,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:50:37,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 10:50:37,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:50:37,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:50:37,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:50:37,788 INFO L87 Difference]: Start difference. First operand 319 states and 364 transitions. Second operand 47 states. [2019-09-07 10:50:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:50:38,788 INFO L93 Difference]: Finished difference Result 554 states and 646 transitions. [2019-09-07 10:50:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:50:38,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 99 [2019-09-07 10:50:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:50:38,791 INFO L225 Difference]: With dead ends: 554 [2019-09-07 10:50:38,791 INFO L226 Difference]: Without dead ends: 328 [2019-09-07 10:50:38,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:50:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-07 10:50:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2019-09-07 10:50:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-07 10:50:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 372 transitions. [2019-09-07 10:50:38,802 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 372 transitions. Word has length 99 [2019-09-07 10:50:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:50:38,802 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 372 transitions. [2019-09-07 10:50:38,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:50:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 372 transitions. [2019-09-07 10:50:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 10:50:38,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:50:38,803 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:50:38,804 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:50:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:50:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1102820607, now seen corresponding path program 44 times [2019-09-07 10:50:38,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:50:38,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:50:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:38,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:50:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:39,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:50:39,680 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-07 10:50:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:50:39,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:50:39,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:50:39,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:50:39,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:50:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:39,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:50:39,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-07 10:50:39,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:50:39,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:50:39,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:50:39,768 INFO L87 Difference]: Start difference. First operand 326 states and 372 transitions. Second operand 48 states. [2019-09-07 10:50:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:50:40,608 INFO L93 Difference]: Finished difference Result 566 states and 660 transitions. [2019-09-07 10:50:40,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:50:40,608 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 101 [2019-09-07 10:50:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:50:40,611 INFO L225 Difference]: With dead ends: 566 [2019-09-07 10:50:40,611 INFO L226 Difference]: Without dead ends: 335 [2019-09-07 10:50:40,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:50:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-07 10:50:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2019-09-07 10:50:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-07 10:50:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 380 transitions. [2019-09-07 10:50:40,620 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 380 transitions. Word has length 101 [2019-09-07 10:50:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:50:40,621 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 380 transitions. [2019-09-07 10:50:40,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:50:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 380 transitions. [2019-09-07 10:50:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 10:50:40,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:50:40,622 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:50:40,622 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:50:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:50:40,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1164130595, now seen corresponding path program 45 times [2019-09-07 10:50:40,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:50:40,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:50:40,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:40,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:50:40,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:41,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:50:41,635 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-07 10:50:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:51:29,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-07 10:51:29,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:29,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:51:29,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:29,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:51:29,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:51:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:51:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:51:29,251 INFO L87 Difference]: Start difference. First operand 333 states and 380 transitions. Second operand 49 states. [2019-09-07 10:51:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:30,333 INFO L93 Difference]: Finished difference Result 578 states and 674 transitions. [2019-09-07 10:51:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:51:30,334 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 103 [2019-09-07 10:51:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:30,336 INFO L225 Difference]: With dead ends: 578 [2019-09-07 10:51:30,336 INFO L226 Difference]: Without dead ends: 342 [2019-09-07 10:51:30,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:51:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-07 10:51:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-07 10:51:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 10:51:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 388 transitions. [2019-09-07 10:51:30,345 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 388 transitions. Word has length 103 [2019-09-07 10:51:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:30,346 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 388 transitions. [2019-09-07 10:51:30,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:51:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 388 transitions. [2019-09-07 10:51:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 10:51:30,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:30,347 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:30,347 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2139150651, now seen corresponding path program 46 times [2019-09-07 10:51:30,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:30,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:30,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:30,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:31,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:31,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:51:31,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:31,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:51:31,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:31,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:51:31,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:31,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:31,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 10:51:31,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:51:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:51:31,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:51:31,887 INFO L87 Difference]: Start difference. First operand 340 states and 388 transitions. Second operand 50 states. [2019-09-07 10:51:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:33,066 INFO L93 Difference]: Finished difference Result 590 states and 688 transitions. [2019-09-07 10:51:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:51:33,066 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 105 [2019-09-07 10:51:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:33,068 INFO L225 Difference]: With dead ends: 590 [2019-09-07 10:51:33,068 INFO L226 Difference]: Without dead ends: 349 [2019-09-07 10:51:33,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:51:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-07 10:51:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-09-07 10:51:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-07 10:51:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 396 transitions. [2019-09-07 10:51:33,078 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 396 transitions. Word has length 105 [2019-09-07 10:51:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:33,078 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 396 transitions. [2019-09-07 10:51:33,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:51:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 396 transitions. [2019-09-07 10:51:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:51:33,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:33,079 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:33,079 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1683370983, now seen corresponding path program 47 times [2019-09-07 10:51:33,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:33,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:33,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:34,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:34,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 10:51:34,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:51:59,802 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-07 10:51:59,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:59,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:51:59,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:59,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-07 10:51:59,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:51:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:51:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:51:59,860 INFO L87 Difference]: Start difference. First operand 347 states and 396 transitions. Second operand 51 states. [2019-09-07 10:52:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:52:00,849 INFO L93 Difference]: Finished difference Result 602 states and 702 transitions. [2019-09-07 10:52:00,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:52:00,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 107 [2019-09-07 10:52:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:52:00,852 INFO L225 Difference]: With dead ends: 602 [2019-09-07 10:52:00,853 INFO L226 Difference]: Without dead ends: 356 [2019-09-07 10:52:00,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:52:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-07 10:52:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2019-09-07 10:52:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-07 10:52:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 404 transitions. [2019-09-07 10:52:00,868 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 404 transitions. Word has length 107 [2019-09-07 10:52:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:52:00,868 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 404 transitions. [2019-09-07 10:52:00,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:52:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 404 transitions. [2019-09-07 10:52:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 10:52:00,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:52:00,869 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:52:00,869 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:52:00,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:52:00,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1365344119, now seen corresponding path program 48 times [2019-09-07 10:52:00,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:52:00,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:52:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:00,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:52:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:52:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:52:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:52:01,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:52:01,839 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-07 10:52:01,851 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:54:35,843 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-07 10:54:35,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:54:35,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:54:35,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:35,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:35,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 10:54:35,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:54:35,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:54:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:54:35,964 INFO L87 Difference]: Start difference. First operand 354 states and 404 transitions. Second operand 52 states. [2019-09-07 10:54:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:37,231 INFO L93 Difference]: Finished difference Result 614 states and 716 transitions. [2019-09-07 10:54:37,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:54:37,231 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 109 [2019-09-07 10:54:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:37,233 INFO L225 Difference]: With dead ends: 614 [2019-09-07 10:54:37,233 INFO L226 Difference]: Without dead ends: 363 [2019-09-07 10:54:37,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:54:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-07 10:54:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-09-07 10:54:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-07 10:54:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 412 transitions. [2019-09-07 10:54:37,243 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 412 transitions. Word has length 109 [2019-09-07 10:54:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:37,244 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 412 transitions. [2019-09-07 10:54:37,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:54:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 412 transitions. [2019-09-07 10:54:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:54:37,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:37,245 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:37,245 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:37,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2012861269, now seen corresponding path program 49 times [2019-09-07 10:54:37,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:37,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:37,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:38,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:38,266 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-07 10:54:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:54:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:38,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:54:38,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:38,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:38,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 10:54:38,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:54:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:54:38,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:54:38,351 INFO L87 Difference]: Start difference. First operand 361 states and 412 transitions. Second operand 53 states. [2019-09-07 10:54:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:39,649 INFO L93 Difference]: Finished difference Result 626 states and 730 transitions. [2019-09-07 10:54:39,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:54:39,650 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 111 [2019-09-07 10:54:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:39,652 INFO L225 Difference]: With dead ends: 626 [2019-09-07 10:54:39,652 INFO L226 Difference]: Without dead ends: 370 [2019-09-07 10:54:39,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:54:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-07 10:54:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2019-09-07 10:54:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-07 10:54:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 420 transitions. [2019-09-07 10:54:39,663 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 420 transitions. Word has length 111 [2019-09-07 10:54:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:39,663 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 420 transitions. [2019-09-07 10:54:39,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:54:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 420 transitions. [2019-09-07 10:54:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 10:54:39,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:39,664 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:39,664 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1506584499, now seen corresponding path program 50 times [2019-09-07 10:54:39,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:39,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:39,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:54:39,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:40,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:40,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:54:40,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:54:40,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:54:40,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:54:40,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:54:40,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:40,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 10:54:40,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:54:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:54:40,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:54:40,761 INFO L87 Difference]: Start difference. First operand 368 states and 420 transitions. Second operand 54 states. [2019-09-07 10:54:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:42,147 INFO L93 Difference]: Finished difference Result 638 states and 744 transitions. [2019-09-07 10:54:42,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:54:42,148 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 113 [2019-09-07 10:54:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:42,150 INFO L225 Difference]: With dead ends: 638 [2019-09-07 10:54:42,150 INFO L226 Difference]: Without dead ends: 377 [2019-09-07 10:54:42,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:54:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-07 10:54:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-07 10:54:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-07 10:54:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 428 transitions. [2019-09-07 10:54:42,163 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 428 transitions. Word has length 113 [2019-09-07 10:54:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:42,164 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 428 transitions. [2019-09-07 10:54:42,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:54:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 428 transitions. [2019-09-07 10:54:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 10:54:42,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:42,165 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:42,165 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 305912977, now seen corresponding path program 51 times [2019-09-07 10:54:42,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:42,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:42,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:43,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:43,218 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-07 10:54:43,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:56:09,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-07 10:56:09,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:56:09,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:56:09,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:56:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:56:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:56:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-07 10:56:09,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:56:09,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:56:09,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:56:09,353 INFO L87 Difference]: Start difference. First operand 375 states and 428 transitions. Second operand 55 states. [2019-09-07 10:56:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:56:10,728 INFO L93 Difference]: Finished difference Result 650 states and 758 transitions. [2019-09-07 10:56:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 10:56:10,729 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 115 [2019-09-07 10:56:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:56:10,731 INFO L225 Difference]: With dead ends: 650 [2019-09-07 10:56:10,731 INFO L226 Difference]: Without dead ends: 384 [2019-09-07 10:56:10,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:56:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-07 10:56:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2019-09-07 10:56:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-07 10:56:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 436 transitions. [2019-09-07 10:56:10,740 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 436 transitions. Word has length 115 [2019-09-07 10:56:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:56:10,741 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 436 transitions. [2019-09-07 10:56:10,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:56:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 436 transitions. [2019-09-07 10:56:10,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 10:56:10,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:56:10,742 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:56:10,742 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:56:10,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:56:10,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1806782959, now seen corresponding path program 52 times [2019-09-07 10:56:10,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:56:10,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:56:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:10,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:56:10,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:56:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:56:12,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:56:12,287 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-07 10:56:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:56:12,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:56:12,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:56:12,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:56:12,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:56:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:56:12,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:56:12,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 10:56:12,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:56:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:56:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:56:12,403 INFO L87 Difference]: Start difference. First operand 382 states and 436 transitions. Second operand 56 states. [2019-09-07 10:56:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:56:13,353 INFO L93 Difference]: Finished difference Result 662 states and 772 transitions. [2019-09-07 10:56:13,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:56:13,353 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 117 [2019-09-07 10:56:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:56:13,356 INFO L225 Difference]: With dead ends: 662 [2019-09-07 10:56:13,356 INFO L226 Difference]: Without dead ends: 391 [2019-09-07 10:56:13,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:56:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-07 10:56:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2019-09-07 10:56:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-09-07 10:56:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 444 transitions. [2019-09-07 10:56:13,367 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 444 transitions. Word has length 117 [2019-09-07 10:56:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:56:13,367 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 444 transitions. [2019-09-07 10:56:13,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:56:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 444 transitions. [2019-09-07 10:56:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:56:13,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:56:13,368 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:56:13,368 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:56:13,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:56:13,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1033824205, now seen corresponding path program 53 times [2019-09-07 10:56:13,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:56:13,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:56:13,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:13,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:56:13,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:56:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:56:14,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:56:14,576 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:56:14,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:56:49,283 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-07 10:56:49,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:56:49,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:56:49,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:56:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:56:49,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:56:49,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-07 10:56:49,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:56:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:56:49,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:56:49,356 INFO L87 Difference]: Start difference. First operand 389 states and 444 transitions. Second operand 57 states. [2019-09-07 10:56:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:56:50,620 INFO L93 Difference]: Finished difference Result 674 states and 786 transitions. [2019-09-07 10:56:50,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:56:50,621 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 119 [2019-09-07 10:56:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:56:50,623 INFO L225 Difference]: With dead ends: 674 [2019-09-07 10:56:50,624 INFO L226 Difference]: Without dead ends: 398 [2019-09-07 10:56:50,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:56:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-07 10:56:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2019-09-07 10:56:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-07 10:56:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 452 transitions. [2019-09-07 10:56:50,632 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 452 transitions. Word has length 119 [2019-09-07 10:56:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:56:50,632 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 452 transitions. [2019-09-07 10:56:50,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:56:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 452 transitions. [2019-09-07 10:56:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 10:56:50,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:56:50,633 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:56:50,633 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:56:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:56:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1249803819, now seen corresponding path program 54 times [2019-09-07 10:56:50,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:56:50,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:56:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:50,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:56:50,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:56:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:56:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:56:51,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:56:51,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:56:51,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 11:00:10,526 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-07 11:00:10,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:00:10,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 11:00:10,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:00:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:00:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:00:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 11:00:10,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 11:00:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 11:00:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 11:00:10,679 INFO L87 Difference]: Start difference. First operand 396 states and 452 transitions. Second operand 58 states. [2019-09-07 11:00:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:00:11,779 INFO L93 Difference]: Finished difference Result 686 states and 800 transitions. [2019-09-07 11:00:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 11:00:11,780 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 121 [2019-09-07 11:00:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:00:11,782 INFO L225 Difference]: With dead ends: 686 [2019-09-07 11:00:11,783 INFO L226 Difference]: Without dead ends: 405 [2019-09-07 11:00:11,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 11:00:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-07 11:00:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2019-09-07 11:00:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-07 11:00:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 460 transitions. [2019-09-07 11:00:11,791 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 460 transitions. Word has length 121 [2019-09-07 11:00:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:00:11,791 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 460 transitions. [2019-09-07 11:00:11,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 11:00:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 460 transitions. [2019-09-07 11:00:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 11:00:11,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:00:11,792 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:00:11,793 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:00:11,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:00:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1647184631, now seen corresponding path program 55 times [2019-09-07 11:00:11,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:00:11,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:00:11,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:11,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:00:11,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:00:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:00:12,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:00:12,963 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) [2019-09-07 11:00:12,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:00:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:00:13,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 11:00:13,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:00:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:00:13,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:00:13,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-07 11:00:13,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 11:00:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 11:00:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:00:13,066 INFO L87 Difference]: Start difference. First operand 403 states and 460 transitions. Second operand 59 states. [2019-09-07 11:00:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:00:14,707 INFO L93 Difference]: Finished difference Result 698 states and 814 transitions. [2019-09-07 11:00:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 11:00:14,708 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 123 [2019-09-07 11:00:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:00:14,710 INFO L225 Difference]: With dead ends: 698 [2019-09-07 11:00:14,710 INFO L226 Difference]: Without dead ends: 412 [2019-09-07 11:00:14,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 11:00:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-07 11:00:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2019-09-07 11:00:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-07 11:00:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 468 transitions. [2019-09-07 11:00:14,719 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 468 transitions. Word has length 123 [2019-09-07 11:00:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:00:14,719 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 468 transitions. [2019-09-07 11:00:14,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 11:00:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 468 transitions. [2019-09-07 11:00:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 11:00:14,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:00:14,720 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:00:14,720 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:00:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:00:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1780690023, now seen corresponding path program 56 times [2019-09-07 11:00:14,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:00:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:00:14,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:14,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:00:14,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:00:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:00:16,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:00:16,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:00:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:00:16,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:00:16,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:00:16,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 11:00:16,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:00:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (57)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:00:16,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 11:00:16,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-07 11:00:16,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 11:00:16,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 11:00:16,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 11:00:16,397 INFO L87 Difference]: Start difference. First operand 410 states and 468 transitions. Second operand 60 states. [2019-09-07 11:00:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:00:17,713 INFO L93 Difference]: Finished difference Result 710 states and 828 transitions. [2019-09-07 11:00:17,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 11:00:17,713 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 125 [2019-09-07 11:00:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:00:17,716 INFO L225 Difference]: With dead ends: 710 [2019-09-07 11:00:17,716 INFO L226 Difference]: Without dead ends: 419 [2019-09-07 11:00:17,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 11:00:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-07 11:00:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2019-09-07 11:00:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-07 11:00:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 476 transitions. [2019-09-07 11:00:17,726 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 476 transitions. Word has length 125 [2019-09-07 11:00:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:00:17,726 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 476 transitions. [2019-09-07 11:00:17,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 11:00:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 476 transitions. [2019-09-07 11:00:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 11:00:17,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:00:17,727 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:00:17,727 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:00:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:00:17,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1728316485, now seen corresponding path program 57 times [2019-09-07 11:00:17,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:00:17,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:00:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:17,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:00:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:00:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:00:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 11:00:18,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:00:18,973 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-07 11:00:18,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2