java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_break.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:46:06,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:46:06,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:46:06,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:46:06,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:46:06,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:46:06,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:46:06,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:46:06,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:46:06,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:46:06,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:46:06,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:46:06,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:46:06,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:46:06,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:46:06,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:46:06,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:46:06,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:46:06,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:46:06,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:46:06,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:46:06,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:46:06,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:46:06,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:46:06,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:46:06,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:46:06,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:46:06,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:46:06,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:46:06,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:46:06,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:46:06,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:46:06,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:46:06,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:46:06,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:46:06,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:46:06,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:46:06,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:46:06,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:46:06,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:46:06,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:46:06,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:46:06,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:46:06,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:46:06,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:46:06,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:46:06,440 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:46:06,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:46:06,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:46:06,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:46:06,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:46:06,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:46:06,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:46:06,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:46:06,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:46:06,444 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:46:06,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:46:06,445 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:46:06,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:46:06,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:46:06,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:46:06,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:46:06,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:46:06,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:46:06,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:46:06,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:46:06,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:46:06,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:46:06,451 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:46:06,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:46:06,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:46:06,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:46:06,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:46:06,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:46:06,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:46:06,507 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:46:06,508 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_break.i [2019-09-07 10:46:06,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031117de5/28639d86b2224c0281c9f1e60decfcfb/FLAGb8beee944 [2019-09-07 10:46:06,999 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:46:07,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_break.i [2019-09-07 10:46:07,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031117de5/28639d86b2224c0281c9f1e60decfcfb/FLAGb8beee944 [2019-09-07 10:46:07,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031117de5/28639d86b2224c0281c9f1e60decfcfb [2019-09-07 10:46:07,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:46:07,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:46:07,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:46:07,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:46:07,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:46:07,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:46:07" (1/1) ... [2019-09-07 10:46:07,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428dcc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:07, skipping insertion in model container [2019-09-07 10:46:07,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:46:07" (1/1) ... [2019-09-07 10:46:07,445 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:46:07,461 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:46:07,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:46:09,039 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:46:09,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:46:09,090 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:46:09,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09 WrapperNode [2019-09-07 10:46:09,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:46:09,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:46:09,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:46:09,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:46:09,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... [2019-09-07 10:46:09,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:46:09,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:46:09,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:46:09,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:46:09,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:46:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:46:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:46:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:46:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:46:09,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:46:09,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:46:09,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:46:09,220 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:46:09,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:46:09,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:46:09,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:46:09,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:46:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:46:09,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:46:09,506 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:46:09,507 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-07 10:46:09,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:46:09 BoogieIcfgContainer [2019-09-07 10:46:09,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:46:09,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:46:09,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:46:09,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:46:09,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:46:07" (1/3) ... [2019-09-07 10:46:09,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0fef7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:46:09, skipping insertion in model container [2019-09-07 10:46:09,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:46:09" (2/3) ... [2019-09-07 10:46:09,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0fef7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:46:09, skipping insertion in model container [2019-09-07 10:46:09,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:46:09" (3/3) ... [2019-09-07 10:46:09,516 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_break.i [2019-09-07 10:46:09,527 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:46:09,536 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:46:09,554 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:46:09,587 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:46:09,588 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:46:09,588 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:46:09,588 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:46:09,588 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:46:09,589 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:46:09,589 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:46:09,589 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:46:09,589 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:46:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-07 10:46:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 10:46:09,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:09,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:09,617 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:09,622 INFO L82 PathProgramCache]: Analyzing trace with hash 547567586, now seen corresponding path program 1 times [2019-09-07 10:46:09,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:09,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:09,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:09,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:09,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:09,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:46:09,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:46:09,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:46:09,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:46:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:46:09,770 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-07 10:46:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:09,789 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-09-07 10:46:09,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:46:09,790 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-07 10:46:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:09,797 INFO L225 Difference]: With dead ends: 43 [2019-09-07 10:46:09,797 INFO L226 Difference]: Without dead ends: 21 [2019-09-07 10:46:09,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:46:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-07 10:46:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-07 10:46:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-07 10:46:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-07 10:46:09,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2019-09-07 10:46:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:09,840 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-07 10:46:09,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:46:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-07 10:46:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 10:46:09,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:09,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:09,842 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:09,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1443476915, now seen corresponding path program 1 times [2019-09-07 10:46:09,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:09,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:09,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:09,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:09,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:46:09,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:46:09,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:46:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:46:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:46:09,904 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-09-07 10:46:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:09,951 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-09-07 10:46:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:46:09,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 10:46:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:09,955 INFO L225 Difference]: With dead ends: 42 [2019-09-07 10:46:09,955 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:46:09,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:46:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:46:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-09-07 10:46:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:46:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-07 10:46:09,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2019-09-07 10:46:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:09,966 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-07 10:46:09,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:46:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-07 10:46:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:46:09,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:09,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:09,968 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -796107231, now seen corresponding path program 1 times [2019-09-07 10:46:09,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:09,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:10,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:46:10,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:46:10,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:46:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:46:10,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:46:10,025 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2019-09-07 10:46:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:10,042 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-09-07 10:46:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:46:10,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:46:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:10,044 INFO L225 Difference]: With dead ends: 37 [2019-09-07 10:46:10,044 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 10:46:10,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:46:10,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 10:46:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 10:46:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:46:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-09-07 10:46:10,050 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2019-09-07 10:46:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:10,051 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-09-07 10:46:10,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:46:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-09-07 10:46:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 10:46:10,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:10,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:10,052 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2000433480, now seen corresponding path program 1 times [2019-09-07 10:46:10,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:10,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:10,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:10,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:10,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:10,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:10,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:46:10,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:10,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:10,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:46:10,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:46:10,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:46:10,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:46:10,236 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2019-09-07 10:46:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:10,338 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-09-07 10:46:10,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:46:10,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-07 10:46:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:10,342 INFO L225 Difference]: With dead ends: 49 [2019-09-07 10:46:10,342 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 10:46:10,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:46:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 10:46:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-09-07 10:46:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 10:46:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-07 10:46:10,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2019-09-07 10:46:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:10,358 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-07 10:46:10,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:46:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-07 10:46:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 10:46:10,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:10,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:10,361 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1356244077, now seen corresponding path program 2 times [2019-09-07 10:46:10,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:10,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:10,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:10,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:10,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:10,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:10,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:10,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:46:10,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:46:10,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:10,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:46:10,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:46:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:46:10,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:46:10,543 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2019-09-07 10:46:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:10,634 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-09-07 10:46:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:46:10,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-07 10:46:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:10,636 INFO L225 Difference]: With dead ends: 57 [2019-09-07 10:46:10,636 INFO L226 Difference]: Without dead ends: 45 [2019-09-07 10:46:10,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:46:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-07 10:46:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2019-09-07 10:46:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:46:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-07 10:46:10,643 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 20 [2019-09-07 10:46:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:10,644 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-07 10:46:10,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:46:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-07 10:46:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:46:10,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:10,647 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:10,648 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash 223617832, now seen corresponding path program 3 times [2019-09-07 10:46:10,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:10,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:10,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:10,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:46:10,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 10:46:10,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:10,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 10:46:10,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 10:46:10,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 10:46:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 10:46:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:46:10,828 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2019-09-07 10:46:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:10,945 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-09-07 10:46:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 10:46:10,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-09-07 10:46:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:10,949 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:46:10,950 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 10:46:10,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 10:46:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 10:46:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-09-07 10:46:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 10:46:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-07 10:46:10,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2019-09-07 10:46:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:10,965 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-07 10:46:10,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 10:46:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-07 10:46:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 10:46:10,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:10,970 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:10,970 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash -581769587, now seen corresponding path program 4 times [2019-09-07 10:46:10,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:10,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:11,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:11,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:11,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:11,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:11,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:11,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:46:11,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:11,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:11,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:46:11,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:46:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:46:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:46:11,206 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states. [2019-09-07 10:46:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:11,291 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-09-07 10:46:11,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:46:11,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-09-07 10:46:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:11,292 INFO L225 Difference]: With dead ends: 73 [2019-09-07 10:46:11,293 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 10:46:11,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:46:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 10:46:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 34. [2019-09-07 10:46:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 10:46:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-09-07 10:46:11,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 26 [2019-09-07 10:46:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:11,301 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-09-07 10:46:11,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:46:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-09-07 10:46:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 10:46:11,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:11,302 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:11,302 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2103913736, now seen corresponding path program 5 times [2019-09-07 10:46:11,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:11,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:11,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:11,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:11,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:46:11,425 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-07 10:46:11,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:11,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:46:11,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:11,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:46:11,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:46:11,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:46:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:46:11,466 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 9 states. [2019-09-07 10:46:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:11,572 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-09-07 10:46:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:46:11,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-09-07 10:46:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:11,574 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:46:11,574 INFO L226 Difference]: Without dead ends: 69 [2019-09-07 10:46:11,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:46:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-07 10:46:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-09-07 10:46:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 10:46:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-07 10:46:11,581 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 29 [2019-09-07 10:46:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:11,581 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-07 10:46:11,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:46:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-07 10:46:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 10:46:11,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:11,583 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:11,583 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 350032045, now seen corresponding path program 6 times [2019-09-07 10:46:11,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:11,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:11,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:11,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:46:11,749 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 10:46:11,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:11,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 10:46:11,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:11,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:11,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 10:46:11,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 10:46:11,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 10:46:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:46:11,788 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 10 states. [2019-09-07 10:46:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:11,912 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-09-07 10:46:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 10:46:11,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-09-07 10:46:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:11,914 INFO L225 Difference]: With dead ends: 89 [2019-09-07 10:46:11,914 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 10:46:11,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 10:46:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 10:46:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 40. [2019-09-07 10:46:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 10:46:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-09-07 10:46:11,921 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 32 [2019-09-07 10:46:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:11,921 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-09-07 10:46:11,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 10:46:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-09-07 10:46:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 10:46:11,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:11,923 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:11,923 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1262268696, now seen corresponding path program 7 times [2019-09-07 10:46:11,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:11,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:12,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:12,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:12,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:12,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:46:12,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:12,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:12,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:46:12,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:46:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:46:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:46:12,131 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 11 states. [2019-09-07 10:46:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:12,277 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2019-09-07 10:46:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:46:12,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-09-07 10:46:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:12,279 INFO L225 Difference]: With dead ends: 97 [2019-09-07 10:46:12,279 INFO L226 Difference]: Without dead ends: 85 [2019-09-07 10:46:12,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:46:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-07 10:46:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 43. [2019-09-07 10:46:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 10:46:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-09-07 10:46:12,287 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 35 [2019-09-07 10:46:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:12,287 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-09-07 10:46:12,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:46:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-09-07 10:46:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 10:46:12,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:12,288 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:12,289 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:12,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1600594637, now seen corresponding path program 8 times [2019-09-07 10:46:12,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:12,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:12,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:12,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:12,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:12,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:12,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:12,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:12,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:46:12,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:12,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:12,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:46:12,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:46:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:46:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:46:12,506 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 12 states. [2019-09-07 10:46:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:12,659 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2019-09-07 10:46:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:46:12,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-09-07 10:46:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:12,661 INFO L225 Difference]: With dead ends: 105 [2019-09-07 10:46:12,661 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 10:46:12,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:46:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 10:46:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 46. [2019-09-07 10:46:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:46:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-09-07 10:46:12,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 38 [2019-09-07 10:46:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:12,669 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-09-07 10:46:12,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:46:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-09-07 10:46:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 10:46:12,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:12,671 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:12,671 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash -298415928, now seen corresponding path program 9 times [2019-09-07 10:46:12,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:12,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:12,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:12,786 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:12,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:12,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:12,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:46:12,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 10:46:12,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:12,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 10:46:12,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:12,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:12,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:46:12,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:46:12,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:46:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:46:12,909 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2019-09-07 10:46:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:13,068 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-07 10:46:13,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:46:13,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-09-07 10:46:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:13,070 INFO L225 Difference]: With dead ends: 113 [2019-09-07 10:46:13,070 INFO L226 Difference]: Without dead ends: 101 [2019-09-07 10:46:13,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:46:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-07 10:46:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 49. [2019-09-07 10:46:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 10:46:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-07 10:46:13,079 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 41 [2019-09-07 10:46:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:13,079 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-07 10:46:13,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:46:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-07 10:46:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 10:46:13,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:13,083 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:13,083 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:13,084 INFO L82 PathProgramCache]: Analyzing trace with hash -412934931, now seen corresponding path program 10 times [2019-09-07 10:46:13,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:13,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:13,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:13,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:13,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:13,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:13,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:13,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:13,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:46:13,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:13,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:13,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:46:13,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:46:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:46:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:46:13,445 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 14 states. [2019-09-07 10:46:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:13,604 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2019-09-07 10:46:13,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:46:13,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-09-07 10:46:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:13,606 INFO L225 Difference]: With dead ends: 121 [2019-09-07 10:46:13,606 INFO L226 Difference]: Without dead ends: 109 [2019-09-07 10:46:13,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:46:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-07 10:46:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 52. [2019-09-07 10:46:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 10:46:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-09-07 10:46:13,614 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 44 [2019-09-07 10:46:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:13,614 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-09-07 10:46:13,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:46:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-09-07 10:46:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:46:13,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:13,616 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:13,616 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1844520280, now seen corresponding path program 11 times [2019-09-07 10:46:13,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:13,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:13,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:13,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:13,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:13,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:13,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:13,918 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-07 10:46:13,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:13,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:46:13,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:13,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:13,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:46:13,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:46:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:46:13,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:46:13,979 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 15 states. [2019-09-07 10:46:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:14,168 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2019-09-07 10:46:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:46:14,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2019-09-07 10:46:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:14,170 INFO L225 Difference]: With dead ends: 129 [2019-09-07 10:46:14,170 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 10:46:14,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:46:14,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 10:46:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 55. [2019-09-07 10:46:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 10:46:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-07 10:46:14,186 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 47 [2019-09-07 10:46:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:14,186 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-07 10:46:14,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:46:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-07 10:46:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 10:46:14,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:14,188 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:14,188 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1178403059, now seen corresponding path program 12 times [2019-09-07 10:46:14,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:14,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:14,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:14,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:14,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:14,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:14,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:14,564 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 10:46:14,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:14,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 10:46:14,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:14,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:14,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 10:46:14,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 10:46:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 10:46:14,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:46:14,622 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 16 states. [2019-09-07 10:46:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:14,802 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2019-09-07 10:46:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 10:46:14,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-09-07 10:46:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:14,804 INFO L225 Difference]: With dead ends: 137 [2019-09-07 10:46:14,804 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 10:46:14,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 10:46:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 10:46:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 58. [2019-09-07 10:46:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 10:46:14,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-09-07 10:46:14,819 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 50 [2019-09-07 10:46:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:14,820 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-09-07 10:46:14,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 10:46:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-09-07 10:46:14,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 10:46:14,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:14,821 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:14,821 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:14,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 370820232, now seen corresponding path program 13 times [2019-09-07 10:46:14,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:14,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:14,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:14,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:14,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:14,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:14,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:15,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:46:15,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:15,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:15,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:46:15,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:46:15,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:46:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:46:15,083 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 17 states. [2019-09-07 10:46:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:15,620 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2019-09-07 10:46:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:46:15,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-09-07 10:46:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:15,623 INFO L225 Difference]: With dead ends: 145 [2019-09-07 10:46:15,623 INFO L226 Difference]: Without dead ends: 133 [2019-09-07 10:46:15,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:46:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-07 10:46:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 61. [2019-09-07 10:46:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 10:46:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-09-07 10:46:15,638 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 53 [2019-09-07 10:46:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:15,639 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-09-07 10:46:15,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:46:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-09-07 10:46:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 10:46:15,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:15,640 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:15,641 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash -436680403, now seen corresponding path program 14 times [2019-09-07 10:46:15,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:15,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:15,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:15,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:15,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:46:15,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:15,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:15,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:46:15,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:15,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:46:15,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:46:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:46:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:46:15,885 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2019-09-07 10:46:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:16,109 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2019-09-07 10:46:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:46:16,109 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-09-07 10:46:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:16,110 INFO L225 Difference]: With dead ends: 153 [2019-09-07 10:46:16,111 INFO L226 Difference]: Without dead ends: 141 [2019-09-07 10:46:16,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:46:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-07 10:46:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 64. [2019-09-07 10:46:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-07 10:46:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-09-07 10:46:16,117 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 56 [2019-09-07 10:46:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:16,117 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-09-07 10:46:16,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:46:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-09-07 10:46:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:46:16,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:16,119 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:16,119 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash -576272792, now seen corresponding path program 15 times [2019-09-07 10:46:16,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:16,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:16,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:16,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:16,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:16,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:16,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:16,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:16,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 10:46:16,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:16,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 10:46:16,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Stream closed [2019-09-07 10:46:16,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:16,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:46:16,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:46:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:46:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:46:16,478 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 19 states. [2019-09-07 10:46:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:16,725 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2019-09-07 10:46:16,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:46:16,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-09-07 10:46:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:16,728 INFO L225 Difference]: With dead ends: 161 [2019-09-07 10:46:16,728 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 10:46:16,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:46:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 10:46:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 67. [2019-09-07 10:46:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 10:46:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-09-07 10:46:16,734 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 59 [2019-09-07 10:46:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:16,734 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-09-07 10:46:16,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:46:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-09-07 10:46:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 10:46:16,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:16,735 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:16,736 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1644790963, now seen corresponding path program 16 times [2019-09-07 10:46:16,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:16,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:16,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:16,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:16,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:16,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:16,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:16,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:17,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:17,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:17,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:46:17,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:17,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:46:17,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:46:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:46:17,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:46:17,837 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 20 states. [2019-09-07 10:46:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:18,105 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2019-09-07 10:46:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:46:18,106 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2019-09-07 10:46:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:18,107 INFO L225 Difference]: With dead ends: 169 [2019-09-07 10:46:18,107 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 10:46:18,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:46:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 10:46:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 70. [2019-09-07 10:46:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 10:46:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2019-09-07 10:46:18,114 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 62 [2019-09-07 10:46:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:18,114 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2019-09-07 10:46:18,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:46:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2019-09-07 10:46:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 10:46:18,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:18,115 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:18,115 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 427974728, now seen corresponding path program 17 times [2019-09-07 10:46:18,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:18,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:18,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:18,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:18,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:18,365 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:46:18,473 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-07 10:46:18,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:18,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:46:18,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:46:18,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:18,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:46:18,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:46:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:46:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:46:18,503 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 21 states. [2019-09-07 10:46:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:18,719 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2019-09-07 10:46:18,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:46:18,719 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2019-09-07 10:46:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:18,721 INFO L225 Difference]: With dead ends: 177 [2019-09-07 10:46:18,721 INFO L226 Difference]: Without dead ends: 165 [2019-09-07 10:46:18,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:46:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-07 10:46:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 73. [2019-09-07 10:46:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 10:46:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-09-07 10:46:18,730 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 65 [2019-09-07 10:46:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:18,730 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-09-07 10:46:18,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:46:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-09-07 10:46:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 10:46:18,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:18,731 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:18,731 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1445860717, now seen corresponding path program 18 times [2019-09-07 10:46:18,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:18,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:18,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:18,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:18,987 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:46:19,476 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 10:46:19,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:19,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 10:46:19,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:19,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:19,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 10:46:19,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 10:46:19,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 10:46:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:46:19,512 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 22 states. [2019-09-07 10:46:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:19,775 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2019-09-07 10:46:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:46:19,777 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-09-07 10:46:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:19,779 INFO L225 Difference]: With dead ends: 185 [2019-09-07 10:46:19,779 INFO L226 Difference]: Without dead ends: 173 [2019-09-07 10:46:19,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 10:46:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-07 10:46:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 76. [2019-09-07 10:46:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-07 10:46:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-09-07 10:46:19,784 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 68 [2019-09-07 10:46:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:19,784 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-09-07 10:46:19,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 10:46:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-09-07 10:46:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:46:19,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:19,786 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:19,786 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1476718040, now seen corresponding path program 19 times [2019-09-07 10:46:19,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:19,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:19,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:19,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:20,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:20,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:20,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:46:20,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:20,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:20,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:46:20,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:46:20,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:46:20,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:46:20,102 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 23 states. [2019-09-07 10:46:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:20,412 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2019-09-07 10:46:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:46:20,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2019-09-07 10:46:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:20,416 INFO L225 Difference]: With dead ends: 193 [2019-09-07 10:46:20,416 INFO L226 Difference]: Without dead ends: 181 [2019-09-07 10:46:20,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:46:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-07 10:46:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 79. [2019-09-07 10:46:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 10:46:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-09-07 10:46:20,423 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 71 [2019-09-07 10:46:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:20,423 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-09-07 10:46:20,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:46:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-09-07 10:46:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 10:46:20,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:20,424 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:20,425 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash -443443315, now seen corresponding path program 20 times [2019-09-07 10:46:20,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:20,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:20,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:20,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:20,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:20,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:20,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:46:20,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:20,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:20,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:46:20,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:20,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:20,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:46:20,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:46:20,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:46:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:46:20,793 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 24 states. [2019-09-07 10:46:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:21,148 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2019-09-07 10:46:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:46:21,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2019-09-07 10:46:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:21,150 INFO L225 Difference]: With dead ends: 201 [2019-09-07 10:46:21,150 INFO L226 Difference]: Without dead ends: 189 [2019-09-07 10:46:21,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:46:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-07 10:46:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 82. [2019-09-07 10:46:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 10:46:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2019-09-07 10:46:21,162 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 74 [2019-09-07 10:46:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:21,162 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2019-09-07 10:46:21,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:46:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2019-09-07 10:46:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 10:46:21,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:21,163 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:21,163 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash -186721272, now seen corresponding path program 21 times [2019-09-07 10:46:21,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:21,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:21,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:21,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:21,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:21,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:46:21,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-07 10:46:21,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:21,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 10:46:21,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:46:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 10:46:21,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 10:46:21,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 10:46:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:46:21,975 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 25 states. [2019-09-07 10:46:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:22,295 INFO L93 Difference]: Finished difference Result 209 states and 233 transitions. [2019-09-07 10:46:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 10:46:22,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-09-07 10:46:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:22,297 INFO L225 Difference]: With dead ends: 209 [2019-09-07 10:46:22,297 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 10:46:22,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 10:46:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 10:46:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 85. [2019-09-07 10:46:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-07 10:46:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-09-07 10:46:22,304 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 77 [2019-09-07 10:46:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:22,304 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-09-07 10:46:22,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 10:46:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-09-07 10:46:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 10:46:22,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:22,305 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:22,306 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1517092435, now seen corresponding path program 22 times [2019-09-07 10:46:22,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:22,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:22,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:22,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:22,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:22,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:23,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:23,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:23,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:46:23,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:23,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:23,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:46:23,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:46:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:46:23,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:46:23,409 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 26 states. [2019-09-07 10:46:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:23,834 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2019-09-07 10:46:23,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:46:23,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 80 [2019-09-07 10:46:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:23,837 INFO L225 Difference]: With dead ends: 217 [2019-09-07 10:46:23,837 INFO L226 Difference]: Without dead ends: 205 [2019-09-07 10:46:23,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:46:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-07 10:46:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 88. [2019-09-07 10:46:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 10:46:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-09-07 10:46:23,844 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 80 [2019-09-07 10:46:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:23,844 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-09-07 10:46:23,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:46:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-09-07 10:46:23,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 10:46:23,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:23,845 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:23,846 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:23,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:23,846 INFO L82 PathProgramCache]: Analyzing trace with hash -646201880, now seen corresponding path program 23 times [2019-09-07 10:46:23,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:23,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:23,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:23,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:23,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:24,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:24,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:46:24,497 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-09-07 10:46:24,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:24,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:46:24,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:24,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:24,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:46:24,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:46:24,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:46:24,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:46:24,537 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 27 states. [2019-09-07 10:46:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:24,963 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2019-09-07 10:46:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:46:24,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-09-07 10:46:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:24,965 INFO L225 Difference]: With dead ends: 225 [2019-09-07 10:46:24,966 INFO L226 Difference]: Without dead ends: 213 [2019-09-07 10:46:24,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:46:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-07 10:46:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 91. [2019-09-07 10:46:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 10:46:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-09-07 10:46:24,972 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 83 [2019-09-07 10:46:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:24,972 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-09-07 10:46:24,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:46:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-09-07 10:46:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 10:46:24,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:24,974 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:24,974 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1843113011, now seen corresponding path program 24 times [2019-09-07 10:46:24,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:24,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:25,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:25,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:25,316 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:46:26,543 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 10:46:26,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:26,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 10:46:26,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:26,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:26,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 10:46:26,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 10:46:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 10:46:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:46:26,573 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 28 states. [2019-09-07 10:46:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:27,010 INFO L93 Difference]: Finished difference Result 233 states and 260 transitions. [2019-09-07 10:46:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 10:46:27,011 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2019-09-07 10:46:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:27,013 INFO L225 Difference]: With dead ends: 233 [2019-09-07 10:46:27,013 INFO L226 Difference]: Without dead ends: 221 [2019-09-07 10:46:27,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 10:46:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-07 10:46:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 94. [2019-09-07 10:46:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 10:46:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2019-09-07 10:46:27,020 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 86 [2019-09-07 10:46:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:27,020 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2019-09-07 10:46:27,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 10:46:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2019-09-07 10:46:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 10:46:27,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:27,021 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:27,022 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2090842056, now seen corresponding path program 25 times [2019-09-07 10:46:27,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:27,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:27,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:27,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:27,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:27,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:27,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:46:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:27,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:46:27,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:46:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:46:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:46:27,503 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 29 states. [2019-09-07 10:46:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:28,053 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2019-09-07 10:46:28,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:46:28,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2019-09-07 10:46:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:28,056 INFO L225 Difference]: With dead ends: 241 [2019-09-07 10:46:28,056 INFO L226 Difference]: Without dead ends: 229 [2019-09-07 10:46:28,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:46:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-07 10:46:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 97. [2019-09-07 10:46:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 10:46:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-09-07 10:46:28,063 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 89 [2019-09-07 10:46:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:28,063 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-09-07 10:46:28,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:46:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-09-07 10:46:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 10:46:28,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:28,064 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:28,065 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1773637101, now seen corresponding path program 26 times [2019-09-07 10:46:28,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:28,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:28,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:46:28,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:28,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:28,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:46:28,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:28,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:46:28,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:46:28,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:46:28,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:46:28,495 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 30 states. [2019-09-07 10:46:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:28,912 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2019-09-07 10:46:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:46:28,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 92 [2019-09-07 10:46:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:28,915 INFO L225 Difference]: With dead ends: 249 [2019-09-07 10:46:28,915 INFO L226 Difference]: Without dead ends: 237 [2019-09-07 10:46:28,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:46:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-07 10:46:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 100. [2019-09-07 10:46:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 10:46:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-09-07 10:46:28,922 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 92 [2019-09-07 10:46:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:28,922 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-09-07 10:46:28,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:46:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-09-07 10:46:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:46:28,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:28,923 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:28,924 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 848873896, now seen corresponding path program 27 times [2019-09-07 10:46:28,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:28,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:28,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:29,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:29,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:29,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:32,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-07 10:46:32,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:32,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 10:46:32,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:32,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:32,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:46:32,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:46:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:46:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:46:32,114 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 31 states. [2019-09-07 10:46:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:32,698 INFO L93 Difference]: Finished difference Result 257 states and 287 transitions. [2019-09-07 10:46:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:46:32,698 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2019-09-07 10:46:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:32,700 INFO L225 Difference]: With dead ends: 257 [2019-09-07 10:46:32,700 INFO L226 Difference]: Without dead ends: 245 [2019-09-07 10:46:32,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:46:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-07 10:46:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 103. [2019-09-07 10:46:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-07 10:46:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-09-07 10:46:32,712 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 95 [2019-09-07 10:46:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:32,712 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-09-07 10:46:32,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:46:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-09-07 10:46:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 10:46:32,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:32,714 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:32,715 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash -851529715, now seen corresponding path program 28 times [2019-09-07 10:46:32,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:32,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:32,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:33,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:33,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:35,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:35,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:35,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:46:35,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:46:35,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:35,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:46:35,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:46:35,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:46:35,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:46:35,849 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 32 states. [2019-09-07 10:46:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:36,475 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2019-09-07 10:46:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:46:36,476 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 98 [2019-09-07 10:46:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:36,478 INFO L225 Difference]: With dead ends: 265 [2019-09-07 10:46:36,478 INFO L226 Difference]: Without dead ends: 253 [2019-09-07 10:46:36,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:46:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-07 10:46:36,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 106. [2019-09-07 10:46:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-07 10:46:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2019-09-07 10:46:36,492 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 98 [2019-09-07 10:46:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:36,493 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2019-09-07 10:46:36,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:46:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2019-09-07 10:46:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 10:46:36,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:36,494 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:36,495 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1563751304, now seen corresponding path program 29 times [2019-09-07 10:46:36,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:36,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:36,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:37,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:37,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:46:37,695 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-09-07 10:46:37,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:37,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:46:37,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:37,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:37,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:46:37,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:46:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:46:37,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:46:37,725 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 33 states. [2019-09-07 10:46:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:38,269 INFO L93 Difference]: Finished difference Result 273 states and 305 transitions. [2019-09-07 10:46:38,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:46:38,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 101 [2019-09-07 10:46:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:38,271 INFO L225 Difference]: With dead ends: 273 [2019-09-07 10:46:38,271 INFO L226 Difference]: Without dead ends: 261 [2019-09-07 10:46:38,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:46:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-07 10:46:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 109. [2019-09-07 10:46:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-07 10:46:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-09-07 10:46:38,281 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 101 [2019-09-07 10:46:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:38,281 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-09-07 10:46:38,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:46:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-09-07 10:46:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 10:46:38,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:38,282 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:38,283 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:38,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1613478445, now seen corresponding path program 30 times [2019-09-07 10:46:38,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:38,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:38,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:38,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:38,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:38,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:38,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:38,899 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:44,106 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 10:46:44,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:44,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 10:46:44,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 10:46:44,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 10:46:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 10:46:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:46:44,141 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 34 states. [2019-09-07 10:46:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:44,695 INFO L93 Difference]: Finished difference Result 281 states and 314 transitions. [2019-09-07 10:46:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 10:46:44,696 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2019-09-07 10:46:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:44,698 INFO L225 Difference]: With dead ends: 281 [2019-09-07 10:46:44,698 INFO L226 Difference]: Without dead ends: 269 [2019-09-07 10:46:44,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 10:46:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-07 10:46:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 112. [2019-09-07 10:46:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 10:46:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-09-07 10:46:44,705 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 104 [2019-09-07 10:46:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:44,706 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-09-07 10:46:44,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 10:46:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-09-07 10:46:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:46:44,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:44,707 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:44,707 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:44,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1271018856, now seen corresponding path program 31 times [2019-09-07 10:46:44,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:44,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:44,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:44,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:45,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:45,162 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:45,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:46:45,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:46:45,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:45,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:46:45,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:46:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:46:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:46:45,243 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 35 states. [2019-09-07 10:46:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:45,816 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2019-09-07 10:46:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:46:45,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 107 [2019-09-07 10:46:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:45,818 INFO L225 Difference]: With dead ends: 289 [2019-09-07 10:46:45,819 INFO L226 Difference]: Without dead ends: 277 [2019-09-07 10:46:45,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:46:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-07 10:46:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 115. [2019-09-07 10:46:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 10:46:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-09-07 10:46:45,826 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 107 [2019-09-07 10:46:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:45,826 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-09-07 10:46:45,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:46:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-09-07 10:46:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 10:46:45,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:45,827 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:45,828 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash -395269043, now seen corresponding path program 32 times [2019-09-07 10:46:45,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:45,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:45,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:46:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:46,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:46,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:46,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:46:46,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:46:46,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:46,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:46:46,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:46,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:46,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:46:46,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:46:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:46:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:46:46,405 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 36 states. [2019-09-07 10:46:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:46,922 INFO L93 Difference]: Finished difference Result 297 states and 332 transitions. [2019-09-07 10:46:46,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:46:46,923 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2019-09-07 10:46:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:46,924 INFO L225 Difference]: With dead ends: 297 [2019-09-07 10:46:46,925 INFO L226 Difference]: Without dead ends: 285 [2019-09-07 10:46:46,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:46:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-07 10:46:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 118. [2019-09-07 10:46:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-07 10:46:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2019-09-07 10:46:46,931 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 110 [2019-09-07 10:46:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:46,931 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2019-09-07 10:46:46,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:46:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2019-09-07 10:46:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 10:46:46,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:46,932 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:46,932 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash 453939016, now seen corresponding path program 33 times [2019-09-07 10:46:46,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:46,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:46,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:46,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:46,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:47,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:47,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:46:47,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:53,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-07 10:46:53,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:53,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 10:46:53,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:53,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:53,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-09-07 10:46:53,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 10:46:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 10:46:53,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:46:53,211 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 37 states. [2019-09-07 10:46:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:54,007 INFO L93 Difference]: Finished difference Result 305 states and 341 transitions. [2019-09-07 10:46:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 10:46:54,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2019-09-07 10:46:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:54,009 INFO L225 Difference]: With dead ends: 305 [2019-09-07 10:46:54,010 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 10:46:54,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 10:46:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 10:46:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 121. [2019-09-07 10:46:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-07 10:46:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-09-07 10:46:54,017 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 113 [2019-09-07 10:46:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:54,018 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-09-07 10:46:54,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 10:46:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-09-07 10:46:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 10:46:54,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:54,020 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:54,020 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:54,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1853851245, now seen corresponding path program 34 times [2019-09-07 10:46:54,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:54,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:54,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:54,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:54,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:54,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:54,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:46:55,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:46:55,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:55,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 10:46:55,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:55,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:55,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 10:46:55,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 10:46:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 10:46:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:46:55,721 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 38 states. [2019-09-07 10:46:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:56,490 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2019-09-07 10:46:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 10:46:56,491 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 116 [2019-09-07 10:46:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:56,494 INFO L225 Difference]: With dead ends: 313 [2019-09-07 10:46:56,494 INFO L226 Difference]: Without dead ends: 301 [2019-09-07 10:46:56,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 10:46:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-07 10:46:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 124. [2019-09-07 10:46:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 10:46:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2019-09-07 10:46:56,501 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 116 [2019-09-07 10:46:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:56,501 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2019-09-07 10:46:56,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 10:46:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2019-09-07 10:46:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 10:46:56,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:56,502 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:56,503 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:56,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1788346072, now seen corresponding path program 35 times [2019-09-07 10:46:56,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:56,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:56,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:57,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:57,069 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:57,079 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:46:58,202 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-07 10:46:58,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:46:58,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 10:46:58,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:46:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:58,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:46:58,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-07 10:46:58,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 10:46:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 10:46:58,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:46:58,244 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 39 states. [2019-09-07 10:46:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:46:59,001 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2019-09-07 10:46:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 10:46:59,002 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 119 [2019-09-07 10:46:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:46:59,004 INFO L225 Difference]: With dead ends: 321 [2019-09-07 10:46:59,005 INFO L226 Difference]: Without dead ends: 309 [2019-09-07 10:46:59,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 10:46:59,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-07 10:46:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 127. [2019-09-07 10:46:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-07 10:46:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-09-07 10:46:59,012 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 119 [2019-09-07 10:46:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:46:59,013 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-09-07 10:46:59,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 10:46:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-09-07 10:46:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 10:46:59,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:46:59,014 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:46:59,014 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:46:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:46:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1565149325, now seen corresponding path program 36 times [2019-09-07 10:46:59,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:46:59,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:46:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:59,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:46:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:46:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:46:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:46:59,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:46:59,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:46:59,592 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:47:34,348 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 10:47:34,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:34,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 10:47:34,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:34,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 10:47:34,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 10:47:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 10:47:34,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:47:34,444 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 40 states. [2019-09-07 10:47:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:35,336 INFO L93 Difference]: Finished difference Result 329 states and 368 transitions. [2019-09-07 10:47:35,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 10:47:35,337 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 122 [2019-09-07 10:47:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:35,338 INFO L225 Difference]: With dead ends: 329 [2019-09-07 10:47:35,338 INFO L226 Difference]: Without dead ends: 317 [2019-09-07 10:47:35,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 10:47:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-07 10:47:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 130. [2019-09-07 10:47:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-07 10:47:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2019-09-07 10:47:35,345 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 122 [2019-09-07 10:47:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:35,346 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2019-09-07 10:47:35,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 10:47:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2019-09-07 10:47:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 10:47:35,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:35,347 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:35,347 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 312249096, now seen corresponding path program 37 times [2019-09-07 10:47:35,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:35,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:35,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:35,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:35,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:36,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:36,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:36,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:47:36,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:47:36,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:36,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-09-07 10:47:36,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 10:47:36,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 10:47:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:47:36,108 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 41 states. [2019-09-07 10:47:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:36,993 INFO L93 Difference]: Finished difference Result 337 states and 377 transitions. [2019-09-07 10:47:36,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 10:47:36,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 125 [2019-09-07 10:47:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:36,995 INFO L225 Difference]: With dead ends: 337 [2019-09-07 10:47:36,995 INFO L226 Difference]: Without dead ends: 325 [2019-09-07 10:47:36,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 10:47:36,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-07 10:47:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 133. [2019-09-07 10:47:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 10:47:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-09-07 10:47:37,002 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 125 [2019-09-07 10:47:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:37,002 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-09-07 10:47:37,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 10:47:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-09-07 10:47:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 10:47:37,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:37,004 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:37,004 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:37,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:37,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1572670803, now seen corresponding path program 38 times [2019-09-07 10:47:37,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:37,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:37,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:37,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:47:37,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:37,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:37,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:47:37,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:47:37,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:37,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 10:47:37,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:37,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:37,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-07 10:47:37,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 10:47:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 10:47:37,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:47:37,793 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 42 states. [2019-09-07 10:47:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:38,468 INFO L93 Difference]: Finished difference Result 345 states and 386 transitions. [2019-09-07 10:47:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 10:47:38,468 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2019-09-07 10:47:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:38,471 INFO L225 Difference]: With dead ends: 345 [2019-09-07 10:47:38,471 INFO L226 Difference]: Without dead ends: 333 [2019-09-07 10:47:38,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 10:47:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-07 10:47:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 136. [2019-09-07 10:47:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 10:47:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2019-09-07 10:47:38,478 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 128 [2019-09-07 10:47:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:38,479 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2019-09-07 10:47:38,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 10:47:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2019-09-07 10:47:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:47:38,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:38,480 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:38,480 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1476013288, now seen corresponding path program 39 times [2019-09-07 10:47:38,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:38,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:38,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:38,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:38,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:39,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:39,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:39,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:47:50,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-07 10:47:50,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:50,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 10:47:50,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:50,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:50,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 10:47:50,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:47:50,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:47:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:47:50,508 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 43 states. [2019-09-07 10:47:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:51,183 INFO L93 Difference]: Finished difference Result 353 states and 395 transitions. [2019-09-07 10:47:51,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 10:47:51,183 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 131 [2019-09-07 10:47:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:51,186 INFO L225 Difference]: With dead ends: 353 [2019-09-07 10:47:51,186 INFO L226 Difference]: Without dead ends: 341 [2019-09-07 10:47:51,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 10:47:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-07 10:47:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 139. [2019-09-07 10:47:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-07 10:47:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-09-07 10:47:51,192 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 131 [2019-09-07 10:47:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:51,193 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-09-07 10:47:51,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:47:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-09-07 10:47:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 10:47:51,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:51,194 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:51,194 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:51,194 INFO L82 PathProgramCache]: Analyzing trace with hash -849640243, now seen corresponding path program 40 times [2019-09-07 10:47:51,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:51,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:51,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:51,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:51,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:51,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:51,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:47:55,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:47:55,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:55,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 10:47:55,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:55,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:55,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-09-07 10:47:55,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 10:47:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 10:47:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:47:55,730 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 44 states. [2019-09-07 10:47:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:47:56,529 INFO L93 Difference]: Finished difference Result 361 states and 404 transitions. [2019-09-07 10:47:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 10:47:56,530 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 134 [2019-09-07 10:47:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:47:56,532 INFO L225 Difference]: With dead ends: 361 [2019-09-07 10:47:56,532 INFO L226 Difference]: Without dead ends: 349 [2019-09-07 10:47:56,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 10:47:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-07 10:47:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 142. [2019-09-07 10:47:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 10:47:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2019-09-07 10:47:56,539 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 134 [2019-09-07 10:47:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:47:56,539 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2019-09-07 10:47:56,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 10:47:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2019-09-07 10:47:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 10:47:56,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:47:56,541 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:47:56,541 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:47:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:47:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2018436808, now seen corresponding path program 41 times [2019-09-07 10:47:56,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:47:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:47:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:56,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:47:56,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:47:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:47:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:57,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:47:57,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:47:57,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:47:59,316 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-09-07 10:47:59,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:47:59,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 10:47:59,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:47:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:47:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:47:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-09-07 10:47:59,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 10:47:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 10:47:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:47:59,354 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 45 states. [2019-09-07 10:48:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:00,250 INFO L93 Difference]: Finished difference Result 369 states and 413 transitions. [2019-09-07 10:48:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 10:48:00,250 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 137 [2019-09-07 10:48:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:00,253 INFO L225 Difference]: With dead ends: 369 [2019-09-07 10:48:00,253 INFO L226 Difference]: Without dead ends: 357 [2019-09-07 10:48:00,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 10:48:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-07 10:48:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 145. [2019-09-07 10:48:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-07 10:48:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-09-07 10:48:00,261 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 137 [2019-09-07 10:48:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:00,261 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-09-07 10:48:00,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 10:48:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-09-07 10:48:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 10:48:00,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:00,262 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:00,263 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 822476525, now seen corresponding path program 42 times [2019-09-07 10:48:00,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:00,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:01,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:01,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:48:01,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:48:39,606 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 10:48:39,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:39,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:48:39,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:39,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:39,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 10:48:39,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 10:48:39,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 10:48:39,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:48:39,688 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 46 states. [2019-09-07 10:48:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:40,561 INFO L93 Difference]: Finished difference Result 377 states and 422 transitions. [2019-09-07 10:48:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 10:48:40,562 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 140 [2019-09-07 10:48:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:40,564 INFO L225 Difference]: With dead ends: 377 [2019-09-07 10:48:40,564 INFO L226 Difference]: Without dead ends: 365 [2019-09-07 10:48:40,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 10:48:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-09-07 10:48:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 148. [2019-09-07 10:48:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-07 10:48:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2019-09-07 10:48:40,570 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 140 [2019-09-07 10:48:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:40,571 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2019-09-07 10:48:40,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 10:48:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2019-09-07 10:48:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 10:48:40,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:40,572 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:40,572 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1276594008, now seen corresponding path program 43 times [2019-09-07 10:48:40,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:40,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:40,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:41,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:41,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:48:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:48:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:41,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 10:48:41,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 10:48:41,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 10:48:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 10:48:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:48:41,610 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 47 states. [2019-09-07 10:48:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:42,693 INFO L93 Difference]: Finished difference Result 385 states and 431 transitions. [2019-09-07 10:48:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 10:48:42,693 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2019-09-07 10:48:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:42,696 INFO L225 Difference]: With dead ends: 385 [2019-09-07 10:48:42,696 INFO L226 Difference]: Without dead ends: 373 [2019-09-07 10:48:42,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 10:48:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-09-07 10:48:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 151. [2019-09-07 10:48:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 10:48:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-09-07 10:48:42,710 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 143 [2019-09-07 10:48:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:42,711 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-09-07 10:48:42,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 10:48:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-09-07 10:48:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 10:48:42,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:42,713 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:42,713 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 36987149, now seen corresponding path program 44 times [2019-09-07 10:48:42,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:42,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:42,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:48:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:44,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:44,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:48:44,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:48:44,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:48:44,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:48:44,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 10:48:44,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:48:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:44,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:48:44,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-09-07 10:48:44,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-09-07 10:48:44,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-09-07 10:48:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:48:44,499 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 48 states. [2019-09-07 10:48:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:48:45,799 INFO L93 Difference]: Finished difference Result 393 states and 440 transitions. [2019-09-07 10:48:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 10:48:45,799 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 146 [2019-09-07 10:48:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:48:45,802 INFO L225 Difference]: With dead ends: 393 [2019-09-07 10:48:45,802 INFO L226 Difference]: Without dead ends: 381 [2019-09-07 10:48:45,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 10:48:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-07 10:48:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 154. [2019-09-07 10:48:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 10:48:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2019-09-07 10:48:45,811 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 146 [2019-09-07 10:48:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:48:45,812 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2019-09-07 10:48:45,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-09-07 10:48:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2019-09-07 10:48:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 10:48:45,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:48:45,814 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:48:45,814 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:48:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:48:45,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1486201480, now seen corresponding path program 45 times [2019-09-07 10:48:45,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:48:45,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:48:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:45,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:48:45,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:48:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:48:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:48:46,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:48:46,958 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:48:46,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:49:59,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-09-07 10:49:59,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:49:59,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:49:59,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:49:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:49:59,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:49:59,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 10:49:59,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 10:49:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 10:49:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:49:59,943 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 49 states. [2019-09-07 10:50:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:50:01,013 INFO L93 Difference]: Finished difference Result 401 states and 449 transitions. [2019-09-07 10:50:01,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 10:50:01,014 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 149 [2019-09-07 10:50:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:50:01,015 INFO L225 Difference]: With dead ends: 401 [2019-09-07 10:50:01,015 INFO L226 Difference]: Without dead ends: 389 [2019-09-07 10:50:01,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 10:50:01,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-07 10:50:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 157. [2019-09-07 10:50:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-07 10:50:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-09-07 10:50:01,022 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 149 [2019-09-07 10:50:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:50:01,022 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-09-07 10:50:01,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 10:50:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-09-07 10:50:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 10:50:01,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:50:01,023 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:50:01,023 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:50:01,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:50:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2019076909, now seen corresponding path program 46 times [2019-09-07 10:50:01,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:50:01,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:50:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:01,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:50:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:01,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:50:01,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:50:01,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:50:05,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:50:05,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:50:05,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 10:50:05,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:50:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:05,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:50:05,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 10:50:05,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:50:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:50:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:50:05,713 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 50 states. [2019-09-07 10:50:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:50:06,848 INFO L93 Difference]: Finished difference Result 409 states and 458 transitions. [2019-09-07 10:50:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 10:50:06,849 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 152 [2019-09-07 10:50:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:50:06,851 INFO L225 Difference]: With dead ends: 409 [2019-09-07 10:50:06,851 INFO L226 Difference]: Without dead ends: 397 [2019-09-07 10:50:06,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 10:50:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-09-07 10:50:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 160. [2019-09-07 10:50:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 10:50:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2019-09-07 10:50:06,859 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 152 [2019-09-07 10:50:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:50:06,859 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2019-09-07 10:50:06,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:50:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2019-09-07 10:50:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 10:50:06,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:50:06,860 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:50:06,861 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:50:06,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:50:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1583111064, now seen corresponding path program 47 times [2019-09-07 10:50:06,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:50:06,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:50:06,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:06,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:50:06,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:08,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:50:08,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:50:08,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:50:10,696 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-09-07 10:50:10,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:50:10,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 10:50:10,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:50:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:10,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:50:10,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-09-07 10:50:10,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 10:50:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 10:50:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:50:10,743 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 51 states. [2019-09-07 10:50:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:50:11,595 INFO L93 Difference]: Finished difference Result 417 states and 467 transitions. [2019-09-07 10:50:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 10:50:11,595 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 155 [2019-09-07 10:50:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:50:11,597 INFO L225 Difference]: With dead ends: 417 [2019-09-07 10:50:11,597 INFO L226 Difference]: Without dead ends: 405 [2019-09-07 10:50:11,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 10:50:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-07 10:50:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 163. [2019-09-07 10:50:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 10:50:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-09-07 10:50:11,603 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 155 [2019-09-07 10:50:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:50:11,603 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-09-07 10:50:11,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 10:50:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-09-07 10:50:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 10:50:11,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:50:11,604 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:50:11,604 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:50:11,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:50:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash -312156851, now seen corresponding path program 48 times [2019-09-07 10:50:11,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:50:11,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:50:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:11,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:50:11,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:50:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:50:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:50:12,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:50:12,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:50:12,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:51:49,856 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-07 10:51:49,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:49,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 10:51:49,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:49,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-09-07 10:51:49,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 10:51:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 10:51:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:51:49,968 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 52 states. [2019-09-07 10:51:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:51,159 INFO L93 Difference]: Finished difference Result 425 states and 476 transitions. [2019-09-07 10:51:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 10:51:51,160 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 158 [2019-09-07 10:51:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:51,162 INFO L225 Difference]: With dead ends: 425 [2019-09-07 10:51:51,162 INFO L226 Difference]: Without dead ends: 413 [2019-09-07 10:51:51,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 10:51:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-07 10:51:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 166. [2019-09-07 10:51:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-07 10:51:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2019-09-07 10:51:51,169 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 158 [2019-09-07 10:51:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:51,169 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2019-09-07 10:51:51,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 10:51:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2019-09-07 10:51:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 10:51:51,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:51,171 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:51,171 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1746878904, now seen corresponding path program 49 times [2019-09-07 10:51:51,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:51,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:51,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:52,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:52,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:51:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:52,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 10:51:52,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:52,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:52,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 10:51:52,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 10:51:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 10:51:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:51:52,596 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 53 states. [2019-09-07 10:51:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:53,956 INFO L93 Difference]: Finished difference Result 433 states and 485 transitions. [2019-09-07 10:51:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:51:53,956 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 161 [2019-09-07 10:51:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:53,959 INFO L225 Difference]: With dead ends: 433 [2019-09-07 10:51:53,959 INFO L226 Difference]: Without dead ends: 421 [2019-09-07 10:51:53,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 10:51:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-07 10:51:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 169. [2019-09-07 10:51:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-07 10:51:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-09-07 10:51:53,966 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 161 [2019-09-07 10:51:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:53,966 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-09-07 10:51:53,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 10:51:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-09-07 10:51:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-07 10:51:53,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:53,967 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:53,967 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -37030035, now seen corresponding path program 50 times [2019-09-07 10:51:53,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:53,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:53,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:51:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:54,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:54,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:55,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:51:55,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:51:55,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:51:55,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 10:51:55,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:51:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:55,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:51:55,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 10:51:55,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 10:51:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 10:51:55,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:51:55,107 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 54 states. [2019-09-07 10:51:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:51:56,271 INFO L93 Difference]: Finished difference Result 441 states and 494 transitions. [2019-09-07 10:51:56,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 10:51:56,271 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 164 [2019-09-07 10:51:56,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:51:56,274 INFO L225 Difference]: With dead ends: 441 [2019-09-07 10:51:56,274 INFO L226 Difference]: Without dead ends: 429 [2019-09-07 10:51:56,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 10:51:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-09-07 10:51:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 172. [2019-09-07 10:51:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-07 10:51:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2019-09-07 10:51:56,281 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 164 [2019-09-07 10:51:56,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:51:56,281 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2019-09-07 10:51:56,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 10:51:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2019-09-07 10:51:56,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 10:51:56,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:51:56,282 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:51:56,282 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:51:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:51:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash -241504216, now seen corresponding path program 51 times [2019-09-07 10:51:56,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:51:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:51:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:56,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:51:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:51:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:51:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:51:57,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:51:57,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:51:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:53:43,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-09-07 10:53:43,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:43,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 10:53:43,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:53:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-09-07 10:53:43,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 10:53:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 10:53:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:53:43,366 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 55 states. [2019-09-07 10:53:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:44,557 INFO L93 Difference]: Finished difference Result 449 states and 503 transitions. [2019-09-07 10:53:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 10:53:44,558 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 167 [2019-09-07 10:53:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:44,561 INFO L225 Difference]: With dead ends: 449 [2019-09-07 10:53:44,561 INFO L226 Difference]: Without dead ends: 437 [2019-09-07 10:53:44,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 10:53:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-07 10:53:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 175. [2019-09-07 10:53:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-07 10:53:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-09-07 10:53:44,569 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 167 [2019-09-07 10:53:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:44,570 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-09-07 10:53:44,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 10:53:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-09-07 10:53:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 10:53:44,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:44,571 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:44,571 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1468204659, now seen corresponding path program 52 times [2019-09-07 10:53:44,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:44,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:44,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:53:45,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:45,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:45,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:53:54,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:53:54,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:53:54,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:53:54,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:53:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:53:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:53:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-09-07 10:53:54,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 10:53:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 10:53:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:53:54,128 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 56 states. [2019-09-07 10:53:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:53:55,333 INFO L93 Difference]: Finished difference Result 457 states and 512 transitions. [2019-09-07 10:53:55,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 10:53:55,334 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 170 [2019-09-07 10:53:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:53:55,337 INFO L225 Difference]: With dead ends: 457 [2019-09-07 10:53:55,337 INFO L226 Difference]: Without dead ends: 445 [2019-09-07 10:53:55,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 10:53:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-07 10:53:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 178. [2019-09-07 10:53:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 10:53:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2019-09-07 10:53:55,345 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 170 [2019-09-07 10:53:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:53:55,345 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2019-09-07 10:53:55,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 10:53:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2019-09-07 10:53:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-07 10:53:55,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:53:55,346 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:53:55,347 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:53:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:53:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash -224380408, now seen corresponding path program 53 times [2019-09-07 10:53:55,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:53:55,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:53:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:55,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:53:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:53:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:53:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:53:56,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:53:56,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:53:56,827 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:54:18,988 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-09-07 10:54:18,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:54:19,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 10:54:19,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:54:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:19,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:54:19,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-07 10:54:19,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:54:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:54:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:54:19,068 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 57 states. [2019-09-07 10:54:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:54:20,264 INFO L93 Difference]: Finished difference Result 465 states and 521 transitions. [2019-09-07 10:54:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 10:54:20,264 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 173 [2019-09-07 10:54:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:54:20,267 INFO L225 Difference]: With dead ends: 465 [2019-09-07 10:54:20,267 INFO L226 Difference]: Without dead ends: 453 [2019-09-07 10:54:20,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 10:54:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-07 10:54:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 181. [2019-09-07 10:54:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-07 10:54:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-09-07 10:54:20,277 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 173 [2019-09-07 10:54:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:54:20,277 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-09-07 10:54:20,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:54:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-09-07 10:54:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-07 10:54:20,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:54:20,279 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:54:20,279 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:54:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:54:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1861018541, now seen corresponding path program 54 times [2019-09-07 10:54:20,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:54:20,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:54:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:20,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:54:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:54:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:54:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:54:21,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:54:21,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:54:21,427 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:57:07,018 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-07 10:57:07,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:57:07,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 10:57:07,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:57:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:57:07,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:57:07,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 10:57:07,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 10:57:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 10:57:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:57:07,161 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 58 states. [2019-09-07 10:57:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:57:08,686 INFO L93 Difference]: Finished difference Result 473 states and 530 transitions. [2019-09-07 10:57:08,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 10:57:08,686 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 176 [2019-09-07 10:57:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:57:08,688 INFO L225 Difference]: With dead ends: 473 [2019-09-07 10:57:08,688 INFO L226 Difference]: Without dead ends: 461 [2019-09-07 10:57:08,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 10:57:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-07 10:57:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 184. [2019-09-07 10:57:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-07 10:57:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2019-09-07 10:57:08,696 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 176 [2019-09-07 10:57:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:57:08,696 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2019-09-07 10:57:08,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 10:57:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2019-09-07 10:57:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-07 10:57:08,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:57:08,697 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:57:08,698 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:57:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:57:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1279171560, now seen corresponding path program 55 times [2019-09-07 10:57:08,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:57:08,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:57:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:57:08,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:57:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:57:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:57:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:57:09,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:57:09,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:57:09,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:57:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:57:10,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:57:10,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:57:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:57:10,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:57:10,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-09-07 10:57:10,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 10:57:10,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 10:57:10,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:57:10,118 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 59 states. [2019-09-07 10:57:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:57:11,174 INFO L93 Difference]: Finished difference Result 481 states and 539 transitions. [2019-09-07 10:57:11,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 10:57:11,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 179 [2019-09-07 10:57:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:57:11,176 INFO L225 Difference]: With dead ends: 481 [2019-09-07 10:57:11,177 INFO L226 Difference]: Without dead ends: 469 [2019-09-07 10:57:11,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 10:57:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-07 10:57:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 187. [2019-09-07 10:57:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-07 10:57:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-09-07 10:57:11,185 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 179 [2019-09-07 10:57:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:57:11,185 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-09-07 10:57:11,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 10:57:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-09-07 10:57:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 10:57:11,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:57:11,187 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:57:11,187 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:57:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:57:11,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1963767245, now seen corresponding path program 56 times [2019-09-07 10:57:11,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:57:11,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:57:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:57:11,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:57:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:57:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:57:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:57:13,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:57:13,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:57:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:57:13,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:57:13,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:57:13,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 10:57:13,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:57:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:57:13,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:57:13,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-07 10:57:13,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 10:57:13,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 10:57:13,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:57:13,480 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 60 states. [2019-09-07 10:57:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:57:15,094 INFO L93 Difference]: Finished difference Result 489 states and 548 transitions. [2019-09-07 10:57:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 10:57:15,094 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 182 [2019-09-07 10:57:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:57:15,096 INFO L225 Difference]: With dead ends: 489 [2019-09-07 10:57:15,096 INFO L226 Difference]: Without dead ends: 477 [2019-09-07 10:57:15,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 10:57:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-07 10:57:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 190. [2019-09-07 10:57:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-07 10:57:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2019-09-07 10:57:15,102 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 182 [2019-09-07 10:57:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:57:15,103 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2019-09-07 10:57:15,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 10:57:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2019-09-07 10:57:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-07 10:57:15,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:57:15,104 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:57:15,104 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:57:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:57:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash -45869624, now seen corresponding path program 57 times [2019-09-07 10:57:15,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:57:15,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:57:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:57:15,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:57:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:57:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:57:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 10:57:16,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:57:16,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:57:16,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2