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-examples/standard_copy3_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:42:25,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:42:25,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:42:25,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:42:25,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:42:25,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:42:25,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:42:25,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:42:25,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:42:25,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:42:25,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:42:25,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:42:25,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:42:25,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:42:25,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:42:25,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:42:25,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:42:25,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:42:25,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:42:25,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:42:25,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:42:25,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:42:25,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:42:25,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:42:25,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:42:25,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:42:25,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:42:25,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:42:25,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:42:25,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:42:25,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:42:25,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:42:25,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:42:25,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:42:25,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:42:25,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:42:25,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:42:25,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:42:25,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:42:25,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:42:25,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:42:25,557 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-10-01 22:42:25,573 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:42:25,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:42:25,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:42:25,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:42:25,575 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:42:25,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:42:25,575 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:42:25,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:42:25,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:42:25,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:42:25,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:42:25,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:42:25,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:42:25,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:42:25,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:42:25,577 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:42:25,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:42:25,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:42:25,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:42:25,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:42:25,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:42:25,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:42:25,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:42:25,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:42:25,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:42:25,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:42:25,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:42:25,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:42:25,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:42:25,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:42:25,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:42:25,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:42:25,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:42:25,626 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:42:25,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy3_ground-1.i [2019-10-01 22:42:25,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd511eac4/0b328117421b4913b082ea37fb7255b2/FLAG16f52799c [2019-10-01 22:42:26,134 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:42:26,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy3_ground-1.i [2019-10-01 22:42:26,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd511eac4/0b328117421b4913b082ea37fb7255b2/FLAG16f52799c [2019-10-01 22:42:26,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd511eac4/0b328117421b4913b082ea37fb7255b2 [2019-10-01 22:42:26,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:42:26,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:42:26,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:42:26,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:42:26,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:42:26,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:26,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237e2548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26, skipping insertion in model container [2019-10-01 22:42:26,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:26,599 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:42:26,617 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:42:26,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:42:26,831 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:42:26,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:42:26,893 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:42:26,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26 WrapperNode [2019-10-01 22:42:26,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:42:26,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:42:26,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:42:26,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:42:27,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (1/1) ... [2019-10-01 22:42:27,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:42:27,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:42:27,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:42:27,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:42:27,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (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-10-01 22:42:27,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:42:27,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:42:27,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:42:27,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:42:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:42:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:42:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:42:27,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:42:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:42:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:42:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:42:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:42:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:42:27,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:42:27,448 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:42:27,448 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-01 22:42:27,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:42:27 BoogieIcfgContainer [2019-10-01 22:42:27,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:42:27,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:42:27,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:42:27,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:42:27,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:42:26" (1/3) ... [2019-10-01 22:42:27,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f894314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:42:27, skipping insertion in model container [2019-10-01 22:42:27,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:26" (2/3) ... [2019-10-01 22:42:27,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f894314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:42:27, skipping insertion in model container [2019-10-01 22:42:27,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:42:27" (3/3) ... [2019-10-01 22:42:27,458 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy3_ground-1.i [2019-10-01 22:42:27,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:42:27,476 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:42:27,496 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:42:27,525 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:42:27,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:42:27,525 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:42:27,525 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:42:27,526 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:42:27,526 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:42:27,526 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:42:27,526 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:42:27,526 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:42:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-01 22:42:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 22:42:27,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:27,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:27,551 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash -496428460, now seen corresponding path program 1 times [2019-10-01 22:42:27,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:27,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:42:27,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:42:27,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:42:27,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:42:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:42:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:42:27,725 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-01 22:42:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:27,746 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2019-10-01 22:42:27,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:42:27,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-10-01 22:42:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:27,755 INFO L225 Difference]: With dead ends: 58 [2019-10-01 22:42:27,755 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:42:27,759 INFO L640 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-10-01 22:42:27,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:42:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-01 22:42:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:42:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:42:27,802 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-10-01 22:42:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:27,803 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:42:27,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:42:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:42:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 22:42:27,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:27,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:27,805 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1263989582, now seen corresponding path program 1 times [2019-10-01 22:42:27,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:27,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:27,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:42:27,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:42:27,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:42:27,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:42:27,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:42:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:42:27,912 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 22:42:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:27,973 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-10-01 22:42:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:42:27,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-01 22:42:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:27,977 INFO L225 Difference]: With dead ends: 50 [2019-10-01 22:42:27,977 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:42:27,979 INFO L640 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-10-01 22:42:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:42:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:42:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:42:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 22:42:27,994 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2019-10-01 22:42:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:27,996 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 22:42:27,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:42:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 22:42:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:42:28,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:28,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:28,001 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1258945684, now seen corresponding path program 1 times [2019-10-01 22:42:28,003 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:28,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:42:28,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:42:28,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:42:28,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:42:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:42:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:42:28,123 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-10-01 22:42:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:28,199 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-10-01 22:42:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:42:28,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-01 22:42:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:28,201 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:42:28,201 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:42:28,202 INFO L640 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-10-01 22:42:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:42:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-01 22:42:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:42:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-01 22:42:28,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2019-10-01 22:42:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:28,219 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-01 22:42:28,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:42:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-01 22:42:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:42:28,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:28,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:28,223 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:28,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1930458438, now seen corresponding path program 1 times [2019-10-01 22:42:28,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:28,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:28,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 22:42:28,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:28,327 INFO L224 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-10-01 22:42:28,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:28,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:42:28,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 22:42:28,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:42:28,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:42:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:42:28,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:42:28,468 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-10-01 22:42:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:28,512 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-10-01 22:42:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:42:28,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-01 22:42:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:28,514 INFO L225 Difference]: With dead ends: 58 [2019-10-01 22:42:28,514 INFO L226 Difference]: Without dead ends: 35 [2019-10-01 22:42:28,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-10-01 22:42:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-01 22:42:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-01 22:42:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 22:42:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-01 22:42:28,522 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2019-10-01 22:42:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:28,523 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-01 22:42:28,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:42:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-01 22:42:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:42:28,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:28,525 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:28,525 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1956939620, now seen corresponding path program 2 times [2019-10-01 22:42:28,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-01 22:42:28,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:28,614 INFO L224 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-10-01 22:42:28,647 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-10-01 22:42:28,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:42:28,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:28,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:42:28,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-01 22:42:28,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:28,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-01 22:42:28,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:42:28,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:42:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:42:28,747 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-10-01 22:42:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:28,914 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-10-01 22:42:28,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:42:28,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-10-01 22:42:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:28,917 INFO L225 Difference]: With dead ends: 69 [2019-10-01 22:42:28,918 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 22:42:28,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:42:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 22:42:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-10-01 22:42:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:42:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-01 22:42:28,925 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2019-10-01 22:42:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:28,926 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-01 22:42:28,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:42:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-01 22:42:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:42:28,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:28,927 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:28,928 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:28,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1304628388, now seen corresponding path program 3 times [2019-10-01 22:42:28,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:28,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:28,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:42:28,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:28,998 INFO L224 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-10-01 22:42:29,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:42:29,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:42:29,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:29,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:42:29,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-01 22:42:29,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 22:42:29,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:42:29,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:42:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:42:29,115 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 9 states. [2019-10-01 22:42:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:29,239 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-10-01 22:42:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:42:29,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-10-01 22:42:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:29,241 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:42:29,241 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:42:29,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:42:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:42:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-10-01 22:42:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 22:42:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-01 22:42:29,250 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2019-10-01 22:42:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:29,250 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-01 22:42:29,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:42:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-01 22:42:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-01 22:42:29,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:29,252 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:29,252 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 849823572, now seen corresponding path program 4 times [2019-10-01 22:42:29,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:29,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:29,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 22:42:29,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:29,363 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:29,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:42:29,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:42:29,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:29,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:42:29,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:42:29,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:29,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:42:29,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:42:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:42:29,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:42:29,465 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2019-10-01 22:42:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:29,519 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2019-10-01 22:42:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:42:29,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-01 22:42:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:29,521 INFO L225 Difference]: With dead ends: 88 [2019-10-01 22:42:29,521 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 22:42:29,522 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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-10-01 22:42:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 22:42:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-10-01 22:42:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:42:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-01 22:42:29,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 45 [2019-10-01 22:42:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:29,539 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-01 22:42:29,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:42:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-01 22:42:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:42:29,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:29,546 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:29,546 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1944957454, now seen corresponding path program 5 times [2019-10-01 22:42:29,547 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:29,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:29,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:29,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:29,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 22:42:29,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:29,671 INFO L224 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-10-01 22:42:29,696 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:42:30,164 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:42:30,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:30,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:42:30,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-01 22:42:30,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:30,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-01 22:42:30,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:42:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:42:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:30,230 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 12 states. [2019-10-01 22:42:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:30,386 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-10-01 22:42:30,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:42:30,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-10-01 22:42:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:30,388 INFO L225 Difference]: With dead ends: 99 [2019-10-01 22:42:30,388 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:42:30,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:42:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-10-01 22:42:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:42:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-10-01 22:42:30,397 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2019-10-01 22:42:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:30,398 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-10-01 22:42:30,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:42:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-10-01 22:42:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:42:30,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:30,400 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:30,400 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1609757718, now seen corresponding path program 6 times [2019-10-01 22:42:30,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:30,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-01 22:42:30,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:30,569 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:42:30,751 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:42:30,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:30,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:42:30,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-01 22:42:30,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:30,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-10-01 22:42:30,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:42:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:42:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:42:30,840 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 14 states. [2019-10-01 22:42:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:30,993 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2019-10-01 22:42:30,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:42:30,994 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-01 22:42:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:30,995 INFO L225 Difference]: With dead ends: 113 [2019-10-01 22:42:30,995 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:42:30,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:42:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:42:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-10-01 22:42:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-01 22:42:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-01 22:42:31,004 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 55 [2019-10-01 22:42:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:31,004 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-01 22:42:31,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:42:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-01 22:42:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 22:42:31,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:31,006 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:31,006 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:31,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash 688370146, now seen corresponding path program 7 times [2019-10-01 22:42:31,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:31,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:31,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 22:42:31,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:31,148 INFO L224 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-10-01 22:42:31,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:31,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:42:31,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:42:31,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:31,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:42:31,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:42:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:42:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:42:31,285 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 11 states. [2019-10-01 22:42:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:31,330 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-10-01 22:42:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:42:31,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-01 22:42:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:31,332 INFO L225 Difference]: With dead ends: 118 [2019-10-01 22:42:31,332 INFO L226 Difference]: Without dead ends: 71 [2019-10-01 22:42:31,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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-10-01 22:42:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-01 22:42:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-01 22:42:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 22:42:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-10-01 22:42:31,349 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 63 [2019-10-01 22:42:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:31,349 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-10-01 22:42:31,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:42:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-10-01 22:42:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:42:31,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:31,353 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:31,354 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:31,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 187010304, now seen corresponding path program 8 times [2019-10-01 22:42:31,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:31,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:31,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:31,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 22:42:31,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:31,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:31,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:42:31,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:42:31,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:31,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:42:31,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 22:42:31,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:31,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:42:31,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:42:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:42:31,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:31,625 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2019-10-01 22:42:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:31,679 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-10-01 22:42:31,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:42:31,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-10-01 22:42:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:31,681 INFO L225 Difference]: With dead ends: 120 [2019-10-01 22:42:31,681 INFO L226 Difference]: Without dead ends: 73 [2019-10-01 22:42:31,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 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-10-01 22:42:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-01 22:42:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-01 22:42:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:42:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-01 22:42:31,689 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 65 [2019-10-01 22:42:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:31,690 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-01 22:42:31,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:42:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-01 22:42:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:42:31,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:31,692 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:31,692 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash -583460706, now seen corresponding path program 9 times [2019-10-01 22:42:31,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:31,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:31,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:31,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:31,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-01 22:42:31,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:31,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:31,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:42:32,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:42:32,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:32,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:42:32,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-01 22:42:32,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:32,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-10-01 22:42:32,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:42:32,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:42:32,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:42:32,171 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 18 states. [2019-10-01 22:42:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:32,360 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-10-01 22:42:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:42:32,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-10-01 22:42:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:32,361 INFO L225 Difference]: With dead ends: 131 [2019-10-01 22:42:32,361 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:42:32,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:42:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:42:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-10-01 22:42:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-01 22:42:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-10-01 22:42:32,369 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 67 [2019-10-01 22:42:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:32,369 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-10-01 22:42:32,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:42:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-10-01 22:42:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 22:42:32,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:32,371 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:32,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash -443077994, now seen corresponding path program 10 times [2019-10-01 22:42:32,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:32,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:32,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:32,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:32,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-01 22:42:32,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:32,491 INFO L224 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-10-01 22:42:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:42:32,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:42:32,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:32,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:42:32,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:42:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-10-01 22:42:32,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:42:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:42:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:42:32,652 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 20 states. [2019-10-01 22:42:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:32,892 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2019-10-01 22:42:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:42:32,894 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2019-10-01 22:42:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:32,895 INFO L225 Difference]: With dead ends: 145 [2019-10-01 22:42:32,895 INFO L226 Difference]: Without dead ends: 92 [2019-10-01 22:42:32,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:42:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-01 22:42:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-10-01 22:42:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 22:42:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-10-01 22:42:32,912 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 75 [2019-10-01 22:42:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:32,913 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-10-01 22:42:32,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:42:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-10-01 22:42:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 22:42:32,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:32,919 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:32,920 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:32,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1426138254, now seen corresponding path program 11 times [2019-10-01 22:42:32,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:32,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:32,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:32,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:32,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 22:42:33,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:33,159 INFO L224 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-10-01 22:42:33,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:42:59,889 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:42:59,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:59,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:42:59,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 22:42:59,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:42:59,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:42:59,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:42:59,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:42:59,960 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 15 states. [2019-10-01 22:43:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:00,002 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-10-01 22:43:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:43:00,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 83 [2019-10-01 22:43:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:00,004 INFO L225 Difference]: With dead ends: 150 [2019-10-01 22:43:00,004 INFO L226 Difference]: Without dead ends: 91 [2019-10-01 22:43:00,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 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-10-01 22:43:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-01 22:43:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-10-01 22:43:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 22:43:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-10-01 22:43:00,011 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 83 [2019-10-01 22:43:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:00,011 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2019-10-01 22:43:00,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:43:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2019-10-01 22:43:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 22:43:00,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:00,013 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:43:00,013 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:00,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1519404204, now seen corresponding path program 12 times [2019-10-01 22:43:00,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:00,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:00,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:00,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-01 22:43:00,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:00,151 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:00,185 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:43:04,513 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:43:04,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:04,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:43:04,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 23 proven. 49 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-10-01 22:43:04,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:04,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2019-10-01 22:43:04,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:43:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:43:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:43:04,715 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 25 states. [2019-10-01 22:43:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:05,095 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2019-10-01 22:43:05,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:43:05,095 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 85 [2019-10-01 22:43:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:05,097 INFO L225 Difference]: With dead ends: 162 [2019-10-01 22:43:05,097 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 22:43:05,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:43:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 22:43:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-10-01 22:43:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 22:43:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-10-01 22:43:05,106 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 85 [2019-10-01 22:43:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:05,107 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-10-01 22:43:05,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:43:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-10-01 22:43:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 22:43:05,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:05,108 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:43:05,109 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:05,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2067317950, now seen corresponding path program 13 times [2019-10-01 22:43:05,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:05,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:05,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:05,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:05,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:43:05,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:05,296 INFO L224 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-10-01 22:43:05,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:05,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:43:05,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:43:05,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:05,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:43:05,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:43:05,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:43:05,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:43:05,395 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 18 states. [2019-10-01 22:43:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:05,456 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2019-10-01 22:43:05,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:43:05,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2019-10-01 22:43:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:05,457 INFO L225 Difference]: With dead ends: 168 [2019-10-01 22:43:05,457 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 22:43:05,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 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-10-01 22:43:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 22:43:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-10-01 22:43:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 22:43:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2019-10-01 22:43:05,464 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 95 [2019-10-01 22:43:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:05,464 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2019-10-01 22:43:05,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:43:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2019-10-01 22:43:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:43:05,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:05,466 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:43:05,466 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash 73312, now seen corresponding path program 14 times [2019-10-01 22:43:05,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:05,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:05,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:43:05,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:05,642 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:05,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:43:05,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:43:05,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:05,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:43:05,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:43:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:05,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:43:05,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:43:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:43:05,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:43:05,770 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 19 states. [2019-10-01 22:43:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:05,842 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2019-10-01 22:43:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:43:05,842 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-10-01 22:43:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:05,843 INFO L225 Difference]: With dead ends: 170 [2019-10-01 22:43:05,844 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 22:43:05,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 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-10-01 22:43:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 22:43:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-10-01 22:43:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-01 22:43:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2019-10-01 22:43:05,852 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 97 [2019-10-01 22:43:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:05,855 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2019-10-01 22:43:05,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:43:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2019-10-01 22:43:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 22:43:05,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:05,856 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:43:05,856 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1806781954, now seen corresponding path program 15 times [2019-10-01 22:43:05,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:05,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:05,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:05,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:43:06,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:06,107 INFO L224 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-10-01 22:43:06,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:43:08,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:43:08,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:08,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:43:08,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 46 proven. 64 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-01 22:43:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:08,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2019-10-01 22:43:08,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:43:08,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:43:08,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:43:08,894 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 32 states. [2019-10-01 22:43:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:09,352 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2019-10-01 22:43:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:43:09,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2019-10-01 22:43:09,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:09,353 INFO L225 Difference]: With dead ends: 185 [2019-10-01 22:43:09,353 INFO L226 Difference]: Without dead ends: 120 [2019-10-01 22:43:09,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1365, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:43:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-01 22:43:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-10-01 22:43:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-01 22:43:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2019-10-01 22:43:09,360 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 99 [2019-10-01 22:43:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:09,361 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2019-10-01 22:43:09,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:43:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2019-10-01 22:43:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-01 22:43:09,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:09,362 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:43:09,363 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:09,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -714064402, now seen corresponding path program 16 times [2019-10-01 22:43:09,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:09,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:09,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:09,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-01 22:43:09,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:09,609 INFO L224 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-10-01 22:43:09,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:43:09,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:43:09,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:09,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:43:09,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-01 22:43:09,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:09,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:43:09,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:43:09,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:43:09,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:43:09,763 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 22 states. [2019-10-01 22:43:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:09,831 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2019-10-01 22:43:09,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:43:09,832 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2019-10-01 22:43:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:09,833 INFO L225 Difference]: With dead ends: 200 [2019-10-01 22:43:09,833 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 22:43:09,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 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-10-01 22:43:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 22:43:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-01 22:43:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-01 22:43:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2019-10-01 22:43:09,841 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 115 [2019-10-01 22:43:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:09,842 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2019-10-01 22:43:09,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:43:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2019-10-01 22:43:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 22:43:09,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:09,843 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:43:09,843 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1782094324, now seen corresponding path program 17 times [2019-10-01 22:43:09,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:09,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:09,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:10,116 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-01 22:43:10,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:10,117 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:44:28,045 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-01 22:44:28,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:28,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:44:28,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-10-01 22:44:28,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:28,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2019-10-01 22:44:28,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 22:44:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 22:44:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=748, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:44:28,331 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 33 states. [2019-10-01 22:44:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:28,640 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2019-10-01 22:44:28,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-01 22:44:28,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 117 [2019-10-01 22:44:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:28,644 INFO L225 Difference]: With dead ends: 211 [2019-10-01 22:44:28,644 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 22:44:28,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=748, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:44:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 22:44:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-10-01 22:44:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-01 22:44:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2019-10-01 22:44:28,651 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 117 [2019-10-01 22:44:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:28,651 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2019-10-01 22:44:28,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 22:44:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2019-10-01 22:44:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-01 22:44:28,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:28,652 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:28,653 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:28,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:28,653 INFO L82 PathProgramCache]: Analyzing trace with hash -990443004, now seen corresponding path program 18 times [2019-10-01 22:44:28,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:28,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:28,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:28,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:28,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-01 22:44:28,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:28,947 INFO L224 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-10-01 22:44:28,975 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:45:25,301 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 22:45:25,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:25,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 22:45:25,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 21 proven. 121 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2019-10-01 22:45:25,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:25,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 37 [2019-10-01 22:45:25,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 22:45:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 22:45:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=960, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:45:25,607 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand 37 states. [2019-10-01 22:45:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:25,963 INFO L93 Difference]: Finished difference Result 228 states and 242 transitions. [2019-10-01 22:45:25,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 22:45:25,963 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 125 [2019-10-01 22:45:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:25,965 INFO L225 Difference]: With dead ends: 228 [2019-10-01 22:45:25,965 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 22:45:25,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=372, Invalid=960, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:45:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 22:45:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-10-01 22:45:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-01 22:45:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2019-10-01 22:45:25,972 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 125 [2019-10-01 22:45:25,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:25,973 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2019-10-01 22:45:25,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 22:45:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2019-10-01 22:45:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-01 22:45:25,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:25,974 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:45:25,974 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash 754179030, now seen corresponding path program 19 times [2019-10-01 22:45:25,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:25,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:25,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-10-01 22:45:26,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:26,335 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:45:26,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:45:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:26,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:45:26,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-10-01 22:45:26,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:26,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:45:26,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:45:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:45:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:45:26,573 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 25 states. [2019-10-01 22:45:26,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:26,653 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 22:45:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:45:26,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2019-10-01 22:45:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:26,655 INFO L225 Difference]: With dead ends: 242 [2019-10-01 22:45:26,655 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 22:45:26,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 139 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-10-01 22:45:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 22:45:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-10-01 22:45:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 22:45:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2019-10-01 22:45:26,662 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 139 [2019-10-01 22:45:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:26,663 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2019-10-01 22:45:26,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:45:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2019-10-01 22:45:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 22:45:26,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:26,664 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:45:26,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash 570165748, now seen corresponding path program 20 times [2019-10-01 22:45:26,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:26,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:26,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:45:26,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-10-01 22:45:27,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:27,051 INFO L224 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-10-01 22:45:27,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:45:27,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:45:27,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:27,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:45:27,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-10-01 22:45:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:45:27,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:45:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:45:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:45:27,226 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 26 states. [2019-10-01 22:45:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:27,303 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 22:45:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:45:27,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 141 [2019-10-01 22:45:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:27,305 INFO L225 Difference]: With dead ends: 244 [2019-10-01 22:45:27,305 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 22:45:27,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 141 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-10-01 22:45:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 22:45:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-10-01 22:45:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-01 22:45:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2019-10-01 22:45:27,312 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 141 [2019-10-01 22:45:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:27,313 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2019-10-01 22:45:27,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:45:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2019-10-01 22:45:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 22:45:27,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:27,314 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:45:27,315 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash -172939118, now seen corresponding path program 21 times [2019-10-01 22:45:27,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:27,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:27,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:27,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-10-01 22:45:27,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:27,694 INFO L224 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-10-01 22:45:27,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:46:11,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:46:11,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:46:11,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:46:11,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:46:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-10-01 22:46:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:46:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 40 [2019-10-01 22:46:11,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:46:11,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:46:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1116, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:46:11,715 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 40 states. [2019-10-01 22:46:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:46:12,015 INFO L93 Difference]: Finished difference Result 255 states and 266 transitions. [2019-10-01 22:46:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:46:12,020 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2019-10-01 22:46:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:46:12,021 INFO L225 Difference]: With dead ends: 255 [2019-10-01 22:46:12,022 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 22:46:12,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=444, Invalid=1116, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:46:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 22:46:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-10-01 22:46:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-01 22:46:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2019-10-01 22:46:12,029 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 143 [2019-10-01 22:46:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:46:12,030 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2019-10-01 22:46:12,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:46:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2019-10-01 22:46:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-01 22:46:12,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:46:12,031 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:46:12,032 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:46:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:46:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1584068982, now seen corresponding path program 22 times [2019-10-01 22:46:12,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:46:12,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:46:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:12,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:46:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 22:46:12,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:12,395 INFO L224 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-10-01 22:46:12,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:46:12,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:46:12,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:46:12,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:46:12,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:46:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:46:12,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:46:12,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17] total 42 [2019-10-01 22:46:12,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:46:12,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:46:12,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=1236, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:46:12,823 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 42 states. [2019-10-01 22:46:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:46:13,225 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2019-10-01 22:46:13,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:46:13,228 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 151 [2019-10-01 22:46:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:46:13,230 INFO L225 Difference]: With dead ends: 269 [2019-10-01 22:46:13,230 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 22:46:13,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=486, Invalid=1236, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:46:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 22:46:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2019-10-01 22:46:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-01 22:46:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2019-10-01 22:46:13,237 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 151 [2019-10-01 22:46:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:46:13,238 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2019-10-01 22:46:13,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:46:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2019-10-01 22:46:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-01 22:46:13,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:46:13,239 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:46:13,239 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:46:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:46:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -92746622, now seen corresponding path program 23 times [2019-10-01 22:46:13,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:46:13,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:46:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:13,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:46:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:46:13,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:13,652 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:46:13,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:48:33,992 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-10-01 22:48:33,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:48:34,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:48:34,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:48:34,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:34,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:48:34,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:48:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:48:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:48:34,144 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 29 states. [2019-10-01 22:48:34,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:34,243 INFO L93 Difference]: Finished difference Result 274 states and 282 transitions. [2019-10-01 22:48:34,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:48:34,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2019-10-01 22:48:34,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:34,245 INFO L225 Difference]: With dead ends: 274 [2019-10-01 22:48:34,245 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 22:48:34,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 159 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-10-01 22:48:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 22:48:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-10-01 22:48:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 22:48:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2019-10-01 22:48:34,253 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 159 [2019-10-01 22:48:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:34,253 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2019-10-01 22:48:34,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:48:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2019-10-01 22:48:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-01 22:48:34,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:34,254 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:48:34,255 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:34,255 INFO L82 PathProgramCache]: Analyzing trace with hash 294305696, now seen corresponding path program 24 times [2019-10-01 22:48:34,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:34,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:48:34,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:48:34,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:34,909 INFO L224 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:48:34,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:51:03,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2019-10-01 22:51:03,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:51:03,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:51:03,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:51:03,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:51:03,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:51:03,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:51:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:51:03,380 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 30 states. [2019-10-01 22:51:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:03,482 INFO L93 Difference]: Finished difference Result 276 states and 284 transitions. [2019-10-01 22:51:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:51:03,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 161 [2019-10-01 22:51:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:03,484 INFO L225 Difference]: With dead ends: 276 [2019-10-01 22:51:03,484 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 22:51:03,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:51:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 22:51:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-10-01 22:51:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-01 22:51:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2019-10-01 22:51:03,492 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 161 [2019-10-01 22:51:03,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:03,492 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2019-10-01 22:51:03,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:51:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2019-10-01 22:51:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 22:51:03,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:03,494 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:51:03,494 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:03,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1410571458, now seen corresponding path program 25 times [2019-10-01 22:51:03,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:03,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:51:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:51:03,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:03,975 INFO L224 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-10-01 22:51:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:51:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:04,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:51:04,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:51:04,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:51:04,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:51:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:51:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:51:04,156 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand 31 states. [2019-10-01 22:51:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:04,254 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2019-10-01 22:51:04,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:51:04,254 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 163 [2019-10-01 22:51:04,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:04,255 INFO L225 Difference]: With dead ends: 278 [2019-10-01 22:51:04,256 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 22:51:04,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 163 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-10-01 22:51:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 22:51:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2019-10-01 22:51:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-01 22:51:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 174 transitions. [2019-10-01 22:51:04,263 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 174 transitions. Word has length 163 [2019-10-01 22:51:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:04,263 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 174 transitions. [2019-10-01 22:51:04,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:51:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 174 transitions. [2019-10-01 22:51:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-01 22:51:04,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:04,265 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:51:04,265 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash 879990620, now seen corresponding path program 26 times [2019-10-01 22:51:04,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:04,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:04,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:51:04,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:51:04,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:04,787 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:51:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:51:04,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:51:04,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:51:04,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:51:04,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:51:05,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 22:51:05,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:51:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:51:05,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:51:05,030 INFO L87 Difference]: Start difference. First operand 170 states and 174 transitions. Second operand 32 states. [2019-10-01 22:51:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:05,132 INFO L93 Difference]: Finished difference Result 280 states and 288 transitions. [2019-10-01 22:51:05,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:51:05,132 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 165 [2019-10-01 22:51:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:05,134 INFO L225 Difference]: With dead ends: 280 [2019-10-01 22:51:05,134 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 22:51:05,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:51:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 22:51:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-10-01 22:51:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 22:51:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2019-10-01 22:51:05,144 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 165 [2019-10-01 22:51:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:05,144 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2019-10-01 22:51:05,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:51:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2019-10-01 22:51:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 22:51:05,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:05,146 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:51:05,146 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1208075270, now seen corresponding path program 27 times [2019-10-01 22:51:05,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:05,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:51:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:51:05,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:05,687 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:51:05,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:52:01,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:52:01,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:52:01,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 22:52:01,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:52:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 57 proven. 225 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2019-10-01 22:52:01,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:52:01,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 50 [2019-10-01 22:52:01,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:52:01,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:52:01,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=1737, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:52:01,918 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand 50 states. [2019-10-01 22:52:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:52:02,976 INFO L93 Difference]: Finished difference Result 292 states and 304 transitions. [2019-10-01 22:52:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 22:52:02,977 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 167 [2019-10-01 22:52:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:52:02,978 INFO L225 Difference]: With dead ends: 292 [2019-10-01 22:52:02,979 INFO L226 Difference]: Without dead ends: 185 [2019-10-01 22:52:02,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1017, Invalid=3273, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:52:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-01 22:52:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-10-01 22:52:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 22:52:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2019-10-01 22:52:02,987 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 167 [2019-10-01 22:52:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:52:02,988 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2019-10-01 22:52:02,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:52:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2019-10-01 22:52:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 22:52:02,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:52:02,989 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:52:02,989 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:52:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:52:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash 884140304, now seen corresponding path program 28 times [2019-10-01 22:52:02,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:52:02,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:52:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:02,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:52:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-10-01 22:52:03,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:52:03,671 INFO L224 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-10-01 22:52:03,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:52:03,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:52:03,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:52:03,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:52:03,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:52:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-10-01 22:52:04,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:52:04,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 19] total 51 [2019-10-01 22:52:04,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:52:04,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:52:04,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=1819, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:52:04,162 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 51 states. [2019-10-01 22:52:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:52:04,625 INFO L93 Difference]: Finished difference Result 307 states and 318 transitions. [2019-10-01 22:52:04,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:52:04,625 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 177 [2019-10-01 22:52:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:52:04,627 INFO L225 Difference]: With dead ends: 307 [2019-10-01 22:52:04,627 INFO L226 Difference]: Without dead ends: 194 [2019-10-01 22:52:04,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=731, Invalid=1819, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:52:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-01 22:52:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2019-10-01 22:52:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-01 22:52:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 194 transitions. [2019-10-01 22:52:04,637 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 194 transitions. Word has length 177 [2019-10-01 22:52:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:52:04,637 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 194 transitions. [2019-10-01 22:52:04,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:52:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 194 transitions. [2019-10-01 22:52:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-01 22:52:04,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:52:04,639 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:52:04,640 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:52:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:52:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash 907643144, now seen corresponding path program 29 times [2019-10-01 22:52:04,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:52:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:52:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:04,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:52:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-10-01 22:52:05,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:52:05,420 INFO L224 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-10-01 22:52:05,465 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:54:56,409 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 22:54:56,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:54:56,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:54:56,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:54:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1602 trivial. 0 not checked. [2019-10-01 22:54:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:54:56,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20] total 53 [2019-10-01 22:54:56,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:54:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:54:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=1972, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:54:56,915 INFO L87 Difference]: Start difference. First operand 190 states and 194 transitions. Second operand 53 states. [2019-10-01 22:54:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:54:57,435 INFO L93 Difference]: Finished difference Result 321 states and 332 transitions. [2019-10-01 22:54:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:54:57,435 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 185 [2019-10-01 22:54:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:54:57,437 INFO L225 Difference]: With dead ends: 321 [2019-10-01 22:54:57,437 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:54:57,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=784, Invalid=1972, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:54:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:54:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-10-01 22:54:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-01 22:54:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 202 transitions. [2019-10-01 22:54:57,445 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 202 transitions. Word has length 185 [2019-10-01 22:54:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:54:57,446 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 202 transitions. [2019-10-01 22:54:57,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:54:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 202 transitions. [2019-10-01 22:54:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-01 22:54:57,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:54:57,447 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:54:57,448 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:54:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:54:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash -24243968, now seen corresponding path program 30 times [2019-10-01 22:54:57,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:54:57,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:54:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:57,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:54:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:54:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-10-01 22:54:58,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:54:58,300 INFO L224 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-10-01 22:54:58,355 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE